leetcode-207:
现在你总共有 n 门课需要选,记为 0
到 n-1
。
在选修某些课程之前需要一些先修课程。 例如,想要学习课程 0 ,你需要先完成课程 1 ,我们用一个匹配来表示他们: [0,1]
给定课程总量以及它们的先决条件,判断是否可能完成所有课程的学习?
算法设计:
首先构建一个key为需提前修的课程的id,value为后面修的课程的id list的字典;遍历该字典的key添加入一个set中,再反过来把key所对应的value当作key遍历。
源代码:
class Solution(object):
def canFinish(self, numCourses, prerequisites):
"""
:type numCourses: int
:type prerequisites: List[List[int]]
:rtype: bool
"""
d = collections.defaultdict(list)
for prerequisite in prerequisites:
d[prerequisite[1]].append(prerequisite[0])
visited = set()
stack = set()
for course in d:
if course not in visited and dfs(course, visited, d, stack):
return False
return True
def dfs(course, visited, d, stack):
if course not in visited:
visited.add(course)
stack.add(course)
neighbors = d[course] if course in d else []
for neighbor in neighbors:
if neighbor not in visited:
if dfs(neighbor, visited, d, stack):
return True
elif neighbor in stack:
return True
stack.remove(course)
return False