链接:
题意
课程有前置要求,前置全部完成以后才能进行该课程,求能不能全部修完
解:
一个数组记录课程一共有几个前置,另一个记录该课程是什么课程的前置
修完的课程,遍历后置课程,减少后置课程的计数
当计数为零时,该课程就可以修了
昨天补得题的一丢丢升级版
实际代码:
#include<bits/stdc++.h>
using namespace std;
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites)
{
vector<int>ans;//add
vector<bool>book(numCourses);
vector<int>du(numCourses,0);
vector<vector<int>>edges(numCourses+7,vector<int>());
for(auto& prerequisite:prerequisites)
{
du[prerequisite[0]]++;
edges[prerequisite[1]].push_back(prerequisite[0]);
}
vector<int>start;
for(int i=0;i<numCourses;i++)
{
if(du[i]==0)
{
start.push_back(i);
ans.push_back(i);
}
}
while(true)
{
vector<int>next;
for(auto& s:start)
{
book[s]=1;
for(auto edge:edges[s])
{
du[edge]--;
if(du[edge]==0)
{
next.push_back(edge);
ans.push_back(edge);
}
}
}
if(next.empty()) break;
start=next;
}
if(ans.size()==numCourses) return ans;
else return vector<int>();
}
限制:
1 <= numCourses <= 2000
0 <= prerequisites.length <= numCourses * (numCourses - 1)
prerequisites[i].length == 2
0 <= ai, bi < numCourses
ai != bi
- 所有
[ai, bi]
互不相同