Skip to content

Commit 05441d3

Browse files
Create 0210-course-schedule-ii.go
Accepted submission: _https://leetcode.com/submissions/detail/871343208/_
1 parent 4efac3d commit 05441d3

File tree

1 file changed

+41
-0
lines changed

1 file changed

+41
-0
lines changed

go/0210-course-schedule-ii.go

Lines changed: 41 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
const CRS = 0
2+
const PRE = 1
3+
func findOrder(numCourses int, prerequisites [][]int) []int {
4+
prereq := make([][]int, 0)
5+
for i := 0; i < numCourses; i++ {
6+
prereq = append(prereq, make([]int, 0))
7+
}
8+
for _, edge := range prerequisites {
9+
prereq[edge[CRS]] = append(prereq[edge[CRS]], edge[PRE])
10+
}
11+
12+
output := make([]int, 0)
13+
visit, cycle := make([]bool, numCourses), make([]bool, numCourses)
14+
15+
var dfs func(int) bool
16+
dfs = func(crs int) bool {
17+
if cycle[crs] {
18+
return false
19+
} else if visit[crs] {
20+
return true
21+
}
22+
23+
cycle[crs] = true
24+
for _, pre := range prereq[crs] {
25+
if !dfs(pre) {
26+
return false
27+
}
28+
}
29+
cycle[crs] = false
30+
visit[crs] = true
31+
output = append(output, crs)
32+
return true
33+
}
34+
35+
for c := 0; c < numCourses; c++ {
36+
if dfs(c) == false {
37+
return []int{}
38+
}
39+
}
40+
return output
41+
}

0 commit comments

Comments
 (0)