210. Course Schedule II

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.

方法1: bfs

basketking: https://www.youtube.com/watch?v=iZGBEy0s6xg

思路： 和207. course schedule bfs一样，只是在每次入度降为0的时候推进result一个课程，此时所有的先修课已经被push过，结果就是修课的顺序

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<vector<int>> graph(numCourses, vector<int> (0));
        vector<int> degree(numCourses, 0);
        queue<int> q;
        vector<int> result;
        
        // 建立graph，注意先修课是a[1], [c1, prereq], [c2, prereq], [c3, prereq] ->{prereq: c1, c2, c3}
        for (auto a: prerequisites){
            graph[a.second].push_back(a.first);
            ++degree[a.first];
        }
        
         // 推进所有入度为零（不需要先修课）的课程
        for (int i = 0; i < numCourses; i++){
            if (degree[i] == 0) {
                q.push(i);
                result.push_back(i);
            }
        }
        
        while (!q.empty()){
            int course = q.front();
            q.pop();
            
            for (auto desc: graph[course]){
                degree[desc] --;
                if (degree[desc] == 0){
                    q.push(desc);
                    result.push_back(desc);
                }
            }
        }
        for (auto d : degree){
            if (d) {
                return {};
            }
        }
        return result;
    }
};

方法2: dfs

huahua: https://www.youtube.com/watch?v=Qqgck2ijUjU

思路： 和207. course schedule 一样，只是需要传递一个与visited顺序相反的vector来记录上课顺序。

易错点

1. 最后要reverse result
2. 在visited之后push_back
3. 如果有环同一返回{}

Complexity

Time: O(E + V) ~ O(V^2)
两个循环

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<vector<int>> graph(numCourses, vector<int> (0));
        vector<int> result;
        vector<int> visited(numCourses, 0);
        
        for (auto a: prerequisites){
            graph[a.second].push_back(a.first);
        }
        
        for (int i = 0; i < numCourses; i++){
            if (dfs(i, graph, visited, result)){
                return {};
            }
        }
        return vector<int> (result.rbegin(), result.rend());
    }
    
    bool dfs(int i, vector<vector<int>> & graph, vector<int> & visited, vector<int> & result){
        if (visited[i] == 1) return true;
        if (visited[i] == 2) {
            return false;
        }
        
        visited[i] = 1;
        for (int j: graph[i]){
            if (dfs(j, graph, visited, result)){
                return true;
            }
        }
        visited[i] = 2;
        result.push_back(i);
        return false;
    }
};