LeetCode 210. Course Schedule II - 拓扑排序（Topological Sort）系列题2

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai.

• For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1.

Return the ordering of courses you should take to finish all courses. If there are many valid answers, return any of them. If it is impossible to finish all courses, return an empty array.

Example 1:

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

Example 2:

Input: numCourses = 4, prerequisites = [[1,0],[2,0],[3,1],[3,2]]
Output: [0,2,1,3]
Explanation: There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0.
So one correct course order is [0,1,2,3]. Another correct ordering is [0,2,1,3].

Example 3:

Input: numCourses = 1, prerequisites = []
Output: [0]

Constraints:

• 1 <= numCourses <= 2000
• 0 <= prerequisites.length <= numCourses * (numCourses - 1)
• prerequisites[i].length == 2
• 0 <= ai, bi < numCourses
• ai != bi
• All the pairs [ai, bi] are distinct.

这题跟LeetCode 207. Course Schedule 几乎一模一样，只是要求返回的结果不一样。两题一起作为拓扑排序的经典入门题。

解题思路参考LeetCode 207. Course Schedule， 这题要求返回修课程的顺序，只要每次从队列里取出课程时，把课程编号放入结果中即可。

class Solution:
    def findOrder(self, numCourses: int, prerequisites: List[List[int]]) -> List[int]:
        indegree = [0] * numCourses
        graph = [[] for i in range(numCourses)]
        cnt = 0
        
        for (c1, c2) in prerequisites:
            if c1 == c2:
                return []
            graph[c2].append(c1)
            indegree[c1] += 1
            cnt += 1
        
        res = []
        q = deque()
        for c in range(numCourses):
            if indegree[c] == 0:
                q.append(c)
        
        while q:
            c1 = q.popleft()
            res.append(c1)
            for c2 in graph[c1]:
                indegree[c2] -= 1
                if indegree[c2] == 0:
                    q.append(c2)
                cnt -= 1
        
        return res if cnt == 0 else []