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.

For example:

2, [[1,0]]

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]

4, [[1,0],[2,0],[3,1],[3,2]]

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].

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<set<int>> graph(numCourses);  
        for(auto pre:prerequisites)   
            graph[pre.second].insert(pre.first);    //建立图  
          
        vector<int> degrees(graph.size(),0);        //建立各个节点的入度  
          
        for(auto n:graph)  
        {  
            for(int neigh:n)  
                degrees[neigh]++;  
        }  
              
        vector<int> order(graph.size(), 0); //次序表
        vector<int> orderNull;
        
        for(int i=0;i<numCourses;i++)           //BFS 循环numCourses次 每次便利所有的节点，能解决就是每次都能便利到一个入度为0的节点，反之不然  
        {  
            int j=0;  
              
            for(;j<numCourses;j++)  
                if(!degrees[j]) break;  
              
            if(j==numCourses)   
                return orderNull;  
              
            degrees[j]=-1;  
            
            order[i] = j;
            
            for(int neigh:graph[j])  
                degrees[neigh]--;  
     }  
        return order;
    }
};