Leetcode-207. 课程表 Course Schedule （拓扑排序） -超详细python

题目

你这个学期必须选修 numCourse 门课程，记为 0 到 numCourse-1 。
在选修某些课程之前需要一些先修课程。 例如，想要学习课程 0 ，你需要先完成课程 1 ，我们用一个匹配来表示他们：[0,1]
给定课程总量以及它们的先决条件，请你判断是否可能完成所有课程的学习？
链接：https://leetcode.com/problems/course-schedule/

There are a total of numCourses courses you have to take, labeled from 0 to numCourses-1.

Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1]

Given the total number of courses and a list of prerequisite pairs, is it possible for you to finish all courses?

Example:

Input: numCourses = 2, prerequisites = [[1,0]]
Output: true
Explanation: There are a total of 2 courses to take.
To take course 1 you should have finished course 0. So it is possible.

思路及代码

拓扑排序：有向图判断是否无环

• 将所有点的入度初始化为1
• 用一个dict来存{出点：入点}，用list来存每个点的入度
• 筛选出所有入度为0的点，并逐一删除
• 如果最后不剩点了，说明没有环

class Solution:
    def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:
        # 有向图找环：拓扑排序
        indegrees = [0] * numCourses
        graph = collections.defaultdict(list)
        for pre in prerequisites:
            graph[pre[1]].append(pre[0])
            indegrees[pre[0]] += 1
        zero = collections.deque([])
        for i in range(numCourses):
            if not indegrees[i]:
                zero.append(i)
        while zero:
            cur = zero.popleft()
            for course in graph[cur]:
                indegrees[course] -= 1
                if not indegrees[course]:
                    zero.append(course)
        return not sum(indegrees)

复杂度

$T=O(n)$
$S=O(n)$