210. Course Schedule II

210. Course Schedule II
     Medium

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:

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

这道题只要对 207. Course Schedule 进行稍微的改进即可。207. Course Schedule 代码链接

拓扑排序的过程中，每个结点入队的同时，将其存入res中。
注意返回res之前要判断是否可进行拓扑排序，如果不能（num!=numCourses），将res清空再返回

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
        vector<vector<int>>g(numCourses);
        vector<int>indegree(numCourses,0);
        for(int i=0;i<prerequisites.size();i++)
        {
            g[prerequisites[i][1]].push_back(prerequisites[i][0]);
            indegree[prerequisites[i][0]]++;
        }
        vector<int>res;
        if(!topsort(res,g,indegree,numCourses)) res.clear();
        return res;
    }
    
    bool topsort(vector<int>&res,vector<vector<int>>&g,vector<int>&indegree,int numCourses)
    {
        int num=0;//root表示入度为0的结点，num为遍历过的结点数
        queue<int>q;
        for(int i=0;i<numCourses;i++)
        {
            if(!indegree[i])//将入度为0的结点入队，相当于删除该结点
            {
                q.push(i);
                res.push_back(i);//入队的同时将结点存进res中
                num++;
            }
        }
        while(q.size())
        {
            int u=q.front();q.pop();
            for(int i=0;i<g[u].size();i++)
            {
                int v=g[u][i];
                indegree[v]--;//与u邻接的结点入度-1
                if(!indegree[v])//如果v入度为0，入队，删除结点
                {
                    q.push(v);
                    res.push_back(v);
                    num++;
                }
            }
        }
        return num==numCourses;
    }
};