【LeetCode】Course Schedule II 解题报告
来源:互联网 发布:站长网站源码 编辑:程序博客网 时间:2024/05/28 05:17
【题目】
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.
For example:
2, [[1,0]]
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]
4, [[1,0],[2,0],[3,1],[3,2]]
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]
.
相比较于 【LeetCode】Course Schedule 解题报告,返回的结果是一组排序结果,而非是否能够排序。
因为只要返回任意一种合法的拓扑排序结果即可,所以只需在BFS过程中记录下来先后访问的节点即可。
【Java代码】
public class Solution { public int[] findOrder(int numCourses, int[][] prerequisites) { List<Set<Integer>> adjLists = new ArrayList<Set<Integer>>(); for (int i = 0; i < numCourses; i++) { adjLists.add(new HashSet<Integer>()); } for (int i = 0; i < prerequisites.length; i++) { adjLists.get(prerequisites[i][1]).add(prerequisites[i][0]); } int[] indegrees = new int[numCourses]; for (int i = 0; i < numCourses; i++) { for (int x : adjLists.get(i)) { indegrees[x]++; } } Queue<Integer> queue = new LinkedList<Integer>(); for (int i = 0; i < numCourses; i++) { if (indegrees[i] == 0) { queue.offer(i); } } int[] res = new int[numCourses]; int count = 0; while (!queue.isEmpty()) { int cur = queue.poll(); for (int x : adjLists.get(cur)) { indegrees[x]--; if (indegrees[x] == 0) { queue.offer(x); } } res[count++] = cur; } if (count == numCourses) return res; return new int[0]; }}
- 【LeetCode】Course Schedule II 解题报告
- [leetcode] 210. Course Schedule II 解题报告
- [Leetcode] 210. Course Schedule II 解题报告
- [LeetCode]Course Schedule,解题报告
- 【LeetCode】Course Schedule 解题报告
- LeetCode-Course Schedule-解题报告
- LeetCode-Course Schedule-解题报告
- [leetcode] 207. Course Schedule 解题报告
- Leetcode解题报告:207. Course Schedule
- [Leetcode] 207. Course Schedule 解题报告
- Course Schedule解题报告
- [leetcode]Course Schedule II
- leetcode - Course Schedule II
- LeetCode Course Schedule II
- [leetcode] Course Schedule II
- leetcode:Course Schedule II
- [LeetCode] Course Schedule II
- Leetcode Course Schedule II
- POJ 1635
- Ext:GirdPanel获取表内指定行数据方法
- linux项目部署常用命令
- 嵌入式系统 Boot Loader 技术内幕
- mybatis 批量insert
- 【LeetCode】Course Schedule II 解题报告
- 手机号的正则表达式
- HiWork,为你开创一种全新的工作方式
- STM32按键扫描/按键中断/外部中断
- [leetcode][回溯] Gray Code
- js中的alert,confirm,prompt,遗忘的角落
- 在ubuntu 12.04中安装与配置sshd服务
- 大数求余
- UVA 10047 The Monocycle