思路
- 建立有向图,记录节点入度
- 将入度为0的结点放入队列
- 进行广度优先搜索,将队头放入答案
- 相邻结点入度-1,入度更新为0则放入队列
代码
class Solution {
private:
vector<vector<int>> edges;
vector<int> indeg;
vector<int> result;
public:
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
edges.resize(numCourses);
indeg.resize(numCourses);
for (const auto& info: prerequisites) {
edges[info[1]].push_back(info[0]);
++indeg[info[0]];
}
queue<int> q;
for (int i = 0; i < numCourses; ++i)
if (indeg[i] == 0)
q.push(i);
while (!q.empty()) {
int u = q.front();q.pop();
result.emplace_back(u);
for (int v: edges[u]) {
--indeg[v];
if (indeg[v] == 0)
q.push(v);
}
}
if(result.size()==numCourses)
return result;
else
return {};
}
};