markilue
/
self_example
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

leecode，rt_phm更新更新

This commit is contained in:
markilue 2023-05-22 14:17:47 +08:00
parent 30aedfc4ab
commit 93c37ea883
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Leecode/src/main/java/com/markilue/leecode/hot100/second/T64_207_CanFinish.java
View File

@ -73,7 +73,7 @@ public class T64_207_CanFinish {
} }
boolean valid = true; boolean valid = true;
//本质上就是图的深度优先搜索:检测这个图是否存在环路
public boolean canFinish1(int numCourses, int[][] prerequisites) { public boolean canFinish1(int numCourses, int[][] prerequisites) {
edge = new ArrayList<>(); edge = new ArrayList<>();
for (int i = 0; i < numCourses; i++) { for (int i = 0; i < numCourses; i++) {
@ -95,6 +95,7 @@ public class T64_207_CanFinish {
return valid; return valid;
} }
//0表示没遍历过；1表示遍历中；2表示遍历过
public void dfs(int start, int[] visited) { public void dfs(int start, int[] visited) {
visited[start] = 1;//设置为遍历过了 visited[start] = 1;//设置为遍历过了
List<Integer> childern = edge.get(start); List<Integer> childern = edge.get(start);