210. Course Schedule II（DFS）

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

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.

本题要求对课程表进行拓扑排序，只需要简单的运用拓扑排序的算法就可得出答案；

拓扑排序算法（DFS版）：

(1) 选择一个入度为0的顶点并输出之；

(2) 从网中删除此顶点及所有 出边。

(3)跳回(1)，直至没有入度为0的点为止。

当循环结束时， 若还有顶点未输出则表明图中存在回路。

代码如下：

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        if(numCourses == 0)  return vector<int>{};   
        vector<int> res;
        vector<int> indegree;
        for(int i = 0; i < numCourses; i++)
            indegree.push_back(0);
        for(int i = 0; i < prerequisites.size(); i++)
            indegree[prerequisites[i].first]++;
        for(int i = 0; i < numCourses; i++)
        {
            int k = find(indegree);
            if(k == -1) return vector<int>{};
            res.push_back(k);
            dele(indegree, prerequisites, k);
        }
        return res;
    }
    
    int find(vector<int>& degree)
    {
        for(int i = 0; i < degree.size(); i++)
            if(degree[i] == 0) 
            {
                degree[i] = -1;
                return i;
            }
        return -1;
    }
    
    void dele(vector<int>& degree, vector<pair<int, int>>& p, int k)
    {
        for(int i = 0; i < p.size(); i++)
        {
            if(p[i].second == k)    degree[p[i].first]--;
        }
    }
    
};