网络拓扑结构

原创

wx596330ff6d68f 2022-10-26 20:44:55 ©著作权

文章标签 sed i++ 文章分类 运维

©著作权归作者所有：来自51CTO博客作者wx596330ff6d68f的原创作品，请联系作者获取转载授权，否则将追究法律责任

210. Course Schedule II

Medium

101071FavoriteShare

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

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
        vector<int> Result;
        vector<vector<int>> Graph(numCourses);
        vector<int> In(numCourses,0);
        queue<int> q;
        for(auto prerequisite : prerequisites){
            Graph[prerequisite[1]].push_back(prerequisite[0]);
            In[prerequisite[0]]++;
        }
        for(int i = 0;i < numCourses;i ++){
            if(In[i] == 0){
                q.push(i);
            }
        }
        while(!q.empty()){
            int tmp = q.front();
            q.pop();
            Result.push_back(tmp);
            for(int i = 0;i < Graph[tmp].size();i++){
                In[Graph[tmp][i]]--;
                if(In[Graph[tmp][i]] == 0){
                    q.push(Graph[tmp][i]);
                }
            }
        }
        if(Result.size() != numCourses){
            Result.clear();
        }
        return Result;
    }
};