给定课程总数和预修课对，求出完成所有课程的顺序。此问题可以通过拓扑排序解决，避免环的存在。使用BFS遍历，记录每个节点的入度，入度为0的节点加入队列，遍历过程中更新子节点的入度，最终输出顺序反序即为答案。若遍历结束后仍有节点未访问，则说明存在环，返回空数组。
题目
There are a total of n courses you have to take, labeled from 0 to n-1.
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1]
Given the total number of courses and a list of prerequisite pairs, return the ordering of courses you should take to finish all courses.
There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.
Example 1:
Input: 2, [[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: 4, [[1,0],[2,0],[3,1]
最低0.47元/天 解锁文章
扫一扫
666
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
