[leetcode] 210. Course Schedule II

Description

There are a total of n courses you have to take, labeled from 0 to n-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, return the ordering of courses you should take to finish all courses.

There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.

Example 1:

Input: 2, [[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: 4, [[1,0],[2,0],[3,1],[3,2]]
Output: [0,1,2,3] or [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] .

Note:

1. The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
2. You may assume that there are no duplicate edges in the input prerequisites.

分析

题目的意思是：给你一些课程，这些课程的学习有先后顺序，题目求你要学习的课程。

• 首先，课程代表结点，课程与课程的联系代表边，我们用一个graph来存储每个课程的入度，例如graph[i]存放的是与course i有边的course，然后我们用inDegree来存放每个结点的入度。然后我们用队列先把入度为0的结点存起来，然后依次取出，队列中的值，对每个结点与只相关的边，我们都要-1，然后又重新把度为0的加入队列，直至队列为空位置。

• 最终若有向图中有环，则结果中元素的个数不等于总课程数，那我们将结果清空即可。

• 本质上这个题目就是一个拓扑排序。

C++实现

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<int> res;
        vector<vector<int>> graph(numCourses,vector<int>(0));
        vector<int> in(numCourses,0);
        for(auto a:prerequisites){
            graph[a.second].push_back(a.first);
            ++in[a.first];
        }
        queue<int> q;
        for(int i=0;i<numCourses;i++){
            if(in[i]==0){
                q.push(i);
            }
        }
        while(!q.empty()){
            int t=q.front();
            res.push_back(t);
            q.pop();
            for(auto a:graph[t]){
                in[a]--;
                if(in[a]==0){
                    q.push(a);
                }
            }
        }
        if(res.size()!=numCourses) res.clear();
        return res;
    }
};

Python实现

class Solution:
    def findOrder(self, numCourses: int, prerequisites: List[List[int]]) -> List[int]:
        indegree=defaultdict(int)
        graph = defaultdict(list)

        for pre in prerequisites:
            graph[pre[1]].append(pre[0])
            indegree[pre[0]]+=1
        
        q = deque()
        for i in range(numCourses):
            if indegree[i]==0:
                q.append(i)
        res = []
        while q:
            v = q.popleft()
            res.append(v)
            for i in graph[v]:
                indegree[i]-=1
                if indegree[i]==0:
                    q.append(i)
                    
        if len(res)==numCourses:
            return res
        else:
            return []
    

参考文献

[LeetCode] Course Schedule II 课程清单之二