-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path207.py
38 lines (26 loc) · 871 Bytes
/
207.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
import re
import collections
import itertools
class Solution:
def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:
dic = collections.defaultdict(list)
visited = set()
traced = set()
for x, y in prerequisites:
dic[x].append(y)
def dfs(i):
if i in traced:
return False
if i in visited:
return True
traced.add(i)
for y in dic[i]:
if not dfs(y):
return False
traced.remove(i)
visited.add(i)
return True
for x in list(dic):
if not dfs(x):
return False
return True