方法一:入度表(bfs)
class Solution {
public:
bool canFinish(int numCourses, vector<vector<int>>& prerequisites){
vector<int> inDegree(numCourses, 0); //入度数组:指向该结点的结点个数
vector<vector<int>> lst(numCourses, vector<int>()); //邻接表
queue<int> que; //0入度队列
for(int i=0;i<prerequisites.size();i++){
inDegree[prerequisites[i][0]]++; //初始化入度数组
lst[prerequisites[i][1]].push_back(prerequisites[i][0]); //初始化邻接表
}
for (int i=0; i<inDegree.size(); i++){
if (inDegree[i] == 0) //将入度为0的结点放入队列
que.push(i);
}
vector<int> ans;
while (!que.empty()){
auto tmp = que.front();
que.pop();
ans.push_back(tmp);
for(int j=0;j<lst[tmp].size();j++){
if(--inDegree[lst[tmp][j]]==0){
que.push(lst[tmp][j]);
}
}
}
return ans.size() == numCourses;
}
};