210. Course Schedule II
2016-04-22 14:23
405 查看
There are a total of n courses you have to take, labeled from
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair:
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:
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
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
Another correct ordering is
Solution1 BFS
//https://leetcode.com/discuss/35605/two-ac-solution-in-java-using-bfs-and-dfs-with-explanation
public 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];
}
0to
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-explanation
public 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];
}
相关文章推荐
- Vim入门基础
- imageLoader保存图片到本地相册
- Android Mms之:草稿管理的应用
- 数据库视图和表的区别
- ubuntu下安装opencv过程
- 使用6to5,让今天就来写ES6的模块化开发!
- C# Ini配置文件
- Android App中制作仿MIUI的Tab切换效果的实例分享
- 了解Android及开发前准备
- linux系统的7种运行级别
- fflush和fsync的区别
- 解决移动端点击链接触发颜色块的问题
- Java 读取扫描枪
- Spring中基于Schema的AOP配置详解
- java 统计代码行数
- linux系统的7种运行级别
- linux系统的7种运行级别
- Linux下集群时间同步
- LeetCode 74. Search a 2D Matrix
- linux基础命令之:su和sudo用户切换命令的使用