拓扑排序
class Solution {
public:
bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
vector<vector<int>> A(numCourses,vector<int>());
vector<int> cnt(numCourses,0);
for(auto& x:prerequisites)
A[x.second].push_back(x.first),++cnt[x.first];
int ans=0;
queue<int> q;
for(int i=0;i<numCourses;++i)
if(cnt[i]==0) ++ans,q.push(i);
while(!q.empty()){
auto x=q.front();q.pop();
for(auto &y:A[x])
if(--cnt[y]==0) ++ans,q.push(y);
}
return ans==numCourses;
}
};