210. Course Schedule II
来源:互联网 发布:2017淘宝打假店铺名单 编辑:程序博客网 时间:2024/04/30 03:07
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]
.
Solution1 BFS
//https://leetcode.com/discuss/35605/two-ac-solution-in-java-using-bfs-and-dfs-with-explanationpublic int[] findOrder(int numCourses, int[][] prerequisites) {int[] indegrees = new int[numCourses];List<List<Integer>> adjs = new ArrayList<>(numCourses);initialiseGraph(indegrees, adjs, prerequisites);return solveByBFS(indegrees, adjs);// return solveByDFS(adjs);}private void initialiseGraph(int[] indegrees, List<List<Integer>> adjs, int[][] prerequisites) {int n = indegrees.length;while (n-- > 0)adjs.add(new ArrayList<Integer>());for (int[] edge : prerequisites) {indegrees[edge[0]]++;adjs.get(edge[1]).add(edge[0]);}}private int[] solveByBFS(int[] indegrees, List<List<Integer>> adjs) {int[] order = new int[indegrees.length];Queue<Integer> q = new ArrayDeque<>();for (int i = 0; i < indegrees.length; i++) {if (indegrees[i] == 0)q.offer(i);}int visited = 0;while (!q.isEmpty()) {int from = q.poll();order[visited++] = from;for (int to : adjs.get(from)) {indegrees[to]--;if (indegrees[to] == 0)q.offer(to);}}return visited == indegrees.length ? order : new int[0];}
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II**
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- 210. Course Schedule II
- Vs2012 一直“正在更新 IntelliSense”
- LightOj1303
- Android Mms之:草稿管理的应用
- linux下启动tomcat 服务 常用命令
- 了解Android及开发前准备
- 210. Course Schedule II
- Vim入门基础
- ubuntu下安装opencv过程
- python while循环
- web.xml配置文件总结
- 死亡历险,DELPHI以TByteDynArray(Bytes)方式传递图片到JAVA的WEBSERVICE保存
- c++之精确度
- 【C#关于编码那点事】
- 蓝桥杯星系炸弹C代码实现