广度优先搜索
难度中等
bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
vector<int> inDegree(numCourses, 0);
vector<vector<int>> map(numCourses);
for (int i = 0; i < prerequisites.size(); ++i) {
++inDegree[prerequisites[i][0]];
map[prerequisites[i][1]].push_back(prerequisites[i][0]);
}
queue<int> que;
for (int i = 0; i < numCourses; ++i) {
if (inDegree[i] == 0)
que.push(i);
}
int res = 0;
while (que.size()) {
int localCourse = que.front();
que.pop();
++res;
for (int j = 0; j < map[localCourse].size(); ++j) {
--inDegree[map[localCourse][j]];
if (inDegree[map[localCourse][j]] == 0)
que.push(map[localCourse][j]);
}
}
return res == numCourses;
}