LeetCode 210. Course Schedule II

知识点

拓扑排序

结果

代码

//编号从0开始
class Solution {
public:
    vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
        //前驱后继数组
        vector<vector<int>> adj(numCourses);
        //入度数组,初始化为0
        vector<int> inDegree(numCourses,0);
        
        //填充adj
        int len  = prerequisites.size();
        //前驱，后继
        int before,after;
        for(int i=0;i<len;i++){
            before = prerequisites[i][1];
            after = prerequisites[i][0];
            adj[before].push_back(after);
            inDegree[after]++;
        }
        
        vector<int> seq;
        
        seq = topoSort(adj,inDegree,numCourses);
        
        return seq;
    }
    
    vector<int> topoSort(vector<vector<int>>& adj,vector<int>& inDegree,int numCourses){
        //初始化
        int cnt = 0;
        vector<int> seq;
        queue<int> q;
        for(int i=0;i<inDegree.size();i++){
            if(inDegree[i] == 0){
                q.push(i);
            }
        }
        
        //循环体
        while(!q.empty()){
            int before = q.front();
            seq.push_back(before);
            q.pop();
            cnt++;
            
            for(int i=0;i<adj[before].size();i++){
                int after = adj[before][i];
                inDegree[after]--;
                if(inDegree[after] == 0){
                    q.push(after);
                }
            }
        }
        
        if(cnt == numCourses){
            return seq;
        }else{
            seq.clear();
            return seq;
        }
    }   
};

反思

1. leetcode居然没有时间和空间限制？(lll￢ω￢)看来每次还有截屏结果了！