leetcode+拓扑排序，vector存储图就能过了，问号？

点击打开链接

class Solution {
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<vector<int>> Arr(numCourses+3);
        for(int i=0;i<numCourses+3;i++){
            Arr[i].resize(numCourses+3);
        }
        int d[numCourses+5];
        memset(d, 0, sizeof(d));
        int len = prerequisites.size();
        for(int i=0; i<len;i++){
            Arr[prerequisites[i].second][prerequisites[i].first] = 1;
        }
        for(int i=0;i<numCourses;i++){
            for(int j=0;j<numCourses;j++){
                if(Arr[i][j]==1){
                    d[j]+=1;
                }
            }
        }
        queue<int> Q;
        for(int i=0;i<numCourses;i++){
            if(d[i]==0) Q.push(i);
        }
        int u=0;
        vector<int> result;
        while (!Q.empty()) {
            u= Q.front(); Q.pop();
            result.push_back(u);
            for(int j=0; j<numCourses; j++){
                if(Arr[u][j]==1){
                    d[j]-=1;
                    if(d[j]==0){
                        Q.push(j);
                        Arr[u][j]=-1;
                    }
                }
            }
        }
        if(result.size()!=numCourses) return false;
        for(int i=0; i<numCourses; i++){
            if(d[i]>0) return false;
        }
        return true;
    }
};