LeetCode Course Schedule II
来源:互联网 发布:成都程序员工资一般多少 编辑:程序博客网 时间:2024/05/17 02:27
Description:
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]
.
Solution:
和Course Schedule一样,就是将拓扑的结果任意输出一个。然后发现一个bug,前面没注意到的,pre[i][0]是在pre[i][1]之后的意思……貌似方向搞反了
import java.util.*;public class Solution {public int[] findOrder(int numCourses, int[][] prerequisites) {int n = numCourses;int topo[] = new int[n];int indegree[] = new int[n];int mat[][] = new int[n][n];for (int l = 0; l < prerequisites.length; l++) {int j = prerequisites[l][0];int i = prerequisites[l][1];if (mat[i][j] == 1)continue;mat[i][j] = 1;indegree[j]++;}int index;for (int l = 0; l < n; l++) {index = -1;for (int i = 0; i < n; i++)if (indegree[i] == 0) {indegree[i] = -1;index = i;break;}if (index == -1)return new int[0];topo[l] = index;for (int j = 0; j < n; j++)if (mat[index][j] == 1)indegree[j]--;}return topo;}}
- [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
- LeetCode -- Course Schedule II
- JAVA--IO流(三)
- 研究了一下关于c/c++编译器关于导出函数的不同处理
- c语言 DEBUG 日志打印
- iOS版本号
- 定义Activity切换时的动画效果
- LeetCode Course Schedule II
- Swift教程之可选类型【问号的用法】
- java--异常及异常的处理机制
- "黑马程序员"java集合框架(1)
- php后台修改,前台没变
- java--内部类的总结
- Object转换为JSON格式字符串
- Android Studio将module打包成.jar包
- Caffe 安装错误记录及解决办法