一、题目
There are a total of numCourses courses you have to take, labeled from 0 to numCourses – 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai.
For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1.
Return the ordering of courses you should take to finish all courses. If there are many valid answers, return any of them. If it is impossible to finish all courses, return an empty array.
Example 1:
Input: numCourses = 2, prerequisites = [[1,0]]
Output: [0,1]
Explanation: There are a total of 2 courses to take. To take course 1 you should have finished course 0. So the correct course order is [0,1].
Example 2:
Input: numCourses = 4, prerequisites = [[1,0],[2,0],[3,1],[3,2]]
Output: [0,2,1,3]
Explanation: There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0.
So one correct course order is [0,1,2,3]. Another correct ordering is [0,2,1,3].
Example 3:
Input: numCourses = 1, prerequisites = []
Output: [0]
Constraints:
1 <= numCourses <= 2000
0 <= prerequisites.length <= numCourses * (numCourses – 1)
prerequisites[i].length == 2
0 <= ai, bi < numCourses
ai != bi
All the pairs [ai, bi] are distinct.
二、题解
class Solution {
public:
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
vector<vector<int>> graph;
for(int i = 0;i < numCourses;i++){
graph.push_back({});
}
vector<int> indegree(numCourses,0);
for(auto edge:prerequisites){
graph[edge[1]].push_back(edge[0]);
indegree[edge[0]]++;
}
vector<int> res;
queue<int> q;
for(int i = 0;i < indegree.size();i++){
if(indegree[i] == 0) q.push(i);
}
while(!q.empty()){
int e = q.front();
q.pop();
res.push_back(e);
int size = graph[e].size();
for(int i = 0;i < size;i++){
indegree[graph[e][i]]--;
if(indegree[graph[e][i]] == 0) q.push(graph[e][i]);
}
}
if(res.size() == numCourses) return res;
else return {};
}
};
原文地址:https://blog.csdn.net/weixin_46841376/article/details/136062775
本文来自互联网用户投稿，该文观点仅代表作者本人，不代表本站立场。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。
如若转载，请注明出处：http://www.7code.cn/show_67605.html
如若内容造成侵权/违法违规/事实不符，请联系代码007邮箱：suwngjj01@126.com进行投诉反馈，一经查实，立即删除！
