leetcode 210. Course Schedule II【拓扑排序】

​题目

here are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai.
For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1.
Return the ordering of courses you should take to finish all courses. If there are many valid answers, return any of them. If it is impossible to finish all courses, return an empty array.

Example 1:

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

Example 3:

Input: numCourses = 1, prerequisites = []
Output: [0]

Constraints:

1 <= numCourses <= 2000
0 <= prerequisites.length <= numCourses * (numCourses - 1)
prerequisites[i].length == 2
0 <= ai, bi < numCourses
ai != bi
All the pairs [ai, bi] are distinct.

题意

已知选修课程的先后顺序，检查是否能够完整修完全部课程，若能全部完成，返回完成课程的先后顺序
思路

1邻接表存储图中所有边（方便过程中需要对一个顶点的所有出度边遍历）
2拓扑排序
若最后已处理顶点个数==全部顶点个数，则可以完成全部课程
若最后已处理顶点个数<全部顶点个数，则图中有环，课程不能全部完成
3使用vector记录出队节点顺序，反转即为完成课程的顺序

题解

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
        vector<int> map[11000]; //邻接表存储图
        int edegree[11000]={0}; //入度
        queue<int> q; //BFS队列
        int cnt=0; //计数器--入度为0已处理节点个数
        vector<int> ans; //结果
        for(int i=0;i<prerequisites.size();i++){
            map[prerequisites[i][0]].push_back(prerequisites[i][1]);//存储边
            edegree[prerequisites[i][1]]++;//入度加一
        }
        //找到入度为0的节点
        for(int i=0;i<numCourses;i++){
            if(edegree[i]==0)q.push(i);
        }
        //拓扑排序
        while(!q.empty()){
            int v = q.front();
            q.pop();
            ans.emplace_back(v);
            for(int i=0;i<map[v].size();i++){
                 //相关节点的入度均减一，若已递减到0，加入BFS队列
                if(--edegree[map[v][i]]==0)q.push(map[v][i]);
            }
        }
        reverse(ans.begin(),ans.end());
        return ans.size()==numCourses?ans:vector<int>();
    }
};