-
Notifications
You must be signed in to change notification settings - Fork 17
/
course-schedule-ii.py
81 lines (56 loc) · 1.98 KB
/
course-schedule-ii.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
from enum import Enum
class Solution:
def findOrder(self, numCourses: int, prerequisites: List[List[int]]) -> List[int]:
class Color(Enum):
WHITE = 0
GRAY = 1
BLACK = 2
courses_next = [[] for _ in range(numCourses)]
courses_color = [Color.WHITE for _ in range(numCourses)]
for prerequisite in prerequisites:
courses_next[prerequisite[0]].append(prerequisite[1])
result = []
def dfs(course):
"""
@return False - loop, True - no loop
"""
if courses_color[course] == Color.GRAY:
return False
if courses_color[course] == Color.BLACK:
return True
courses_color[course] = Color.GRAY
for next_course in courses_next[course]:
if not dfs(next_course):
return False
courses_color[course] = Color.BLACK
result.append(course)
return True
for course in range(numCourses):
if not dfs(course):
return []
return result
def findOrderStraighforward(
self, numCourses: int, prerequisites: List[List[int]]
) -> List[int]:
courses = [[] for _ in range(numCourses)]
for prerequisite in prerequisites:
courses[prerequisite[0]].append(prerequisite[1])
taken = set()
result = []
def dfs(course, path):
if course in path:
return False
if course in taken:
return True
path.add(course)
for next_course in courses[course]:
if not dfs(next_course, path):
return False
taken.add(course)
path.remove(course)
result.append(course)
return True
for course in range(numCourses):
if not dfs(course, set()):
return []
return result