class Solution {
public:
bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
vector<int> res;
if(numCourses == 0){
return true;
}
//统计入度
vector<unordered_set<int>> edge(numCourses);
vector<int> indegree(numCourses,0);
for(int i = 0; i<prerequisites.size(); i++){
edge[prerequisites[i].second].insert(prerequisites[i].first);
indegree[prerequisites[i].first]++;
}
//BFS
queue<int> q;
for(int i=0; i<numCourses; i++){
if(indegree[i] == 0){
q.push(i);
}
}
while(!q.empty()){
int course = q.front();
q.pop();
res.push_back(course);
for(auto it=edge[course].begin(); it!=edge[course].end(); it++){
indegree[*it]--;
if(indegree[*it] == 0){
q.push(*it);
}
}
}
if(res.size() == numCourses){
return true;
}
return false;
}
};
207. Course Schedule
最新推荐文章于 2024-01-21 17:16:08 发布