LeetCode Graph:M210. Course Schedule II
来源:互联网 发布:html页面嵌入php代码 编辑:程序博客网 时间:2024/06/07 21:04
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]
.
Note:
- The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
- You may assume that there are no duplicate edges in the input prerequisites.
click to show more hints.
public class Solution { int n; int[][] pre; public int[] findOrder(int numCourses, int[][] prerequisites) { n = numCourses; pre = prerequisites; int[] res = new int[n]; if(n==0) return res; if(n==1) return res; //n>1 //计算每个点前驱个数 int m = pre.length; int[] nums = new int[n]; for(int i=0; i<m; i++){ nums[pre[i][0]]++; } //找到前驱为0的节点,也就是拓扑的的头 Queue<Integer> q = new LinkedList<Integer>(); for(int i=0; i<n; i++){ if(nums[i]==0) q.add(i); } int count = 0; while(!q.isEmpty()){ int t = q.poll(); res[count] = t; count++; for(int i=0; i<m; i++){ int a = pre[i][0]; int b = pre[i][1]; if(b==t){ nums[a]--; if(nums[a]==0) q.add(a); } } } if(count==n) return res; else return new int[0];//注意,不能返回null,要返回0长数组,否则报错 }}
- LeetCode Graph:M210. 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
- 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
- leetcode Course Schedule II
- Course Schedule II -- leetcode
- Leetcode: Course Schedule II
- [Leetcode] Course Schedule II
- 高德地图实现多点标注marker和动态信息窗体
- redis的event处理过程基本流程
- 怎么实现多个jar包一起依赖
- Java面向对象简单总结(二)
- 百练2765八进制小数题解
- LeetCode Graph:M210. Course Schedule II
- 第3节 毛中特(一)
- Python 字符串操作(string替换、删除、截取、复制、连接、比较、查找、包含、大小写转换、分割等)
- 计算机网络面试题
- OpenCV学习之由点集序列或者数组创建凸外形
- C++编译期多态与运行期多态
- 带解题思路:Coursera Machine Learning 第六周 quiz (Machine Learning System Design)
- 马儿走了,传送一篇《终究有梦吧!内马尔有野心,为梦想离开》
- 如何添加动画事件