LeetCode 210. Course Schedule II(课程安排)
2016-05-04 17:09
399 查看
原题网址:https://leetcode.com/problems/course-schedule-ii/
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
Note:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how
a graph is represented.
click to show more hints.
Hints:
This problem is equivalent to finding the topological order in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.
Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining
the basic concepts of Topological Sort.
Topological sort could also be done via BFS.
方法一:广度优先搜索。
方法二:广度优先搜索可以再优化如下。
方法三:深度优先搜索。
There are a total of n courses you have to take, labeled from
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].
Note:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how
a graph is represented.
click to show more hints.
Hints:
This problem is equivalent to finding the topological order in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.
Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining
the basic concepts of Topological Sort.
Topological sort could also be done via BFS.
方法一:广度优先搜索。
public class Solution { public int[] findOrder(int numCourses, int[][] prerequisites) { List<Integer>[] satisfies = new List[numCourses]; int[] requires = new int[numCourses]; for(int i=0; i<numCourses; i++) satisfies[i] = new ArrayList<Integer>(); for(int i=0; i<prerequisites.length; i++) { requires[prerequisites[i][0]] ++; satisfies[prerequisites[i][1]].add(prerequisites[i][0]); } LinkedList<Integer> queue = new LinkedList<>(); for(int i=0; i<numCourses; i++) { if (requires[i]==0) queue.add(i); } int[] courses = new int[numCourses]; int pos = 0; while (!queue.isEmpty()) { int course = queue.remove(); courses[pos++] = course; for(int next: satisfies[course]) { requires[next] --; if (requires[next] == 0) queue.add(next); } } if (pos == courses.length) return courses; else return new int[0]; } }
方法二:广度优先搜索可以再优化如下。
public class Solution { public int[] findOrder(int numCourses, int[][] prerequisites) { int[] requires = new int[numCourses]; List<Integer>[] satisfies = new List[numCourses]; for(int i=0; i<numCourses; i++) satisfies[i] = new ArrayList<>(); for(int[] pre: prerequisites) { requires[pre[0]] ++; satisfies[pre[1]].add(pre[0]); } int[] courses = new int[numCourses]; int course = 0; for(int i=0; i<numCourses; i++) if (requires[i] == 0) courses[course++] = i; for(int current = 0; current < numCourses; current ++) { if (current >= course) return new int[0]; for(int satisfied: satisfies[courses[current]]) { requires[satisfied] --; if (requires[satisfied] == 0) courses[course++] = satisfied; } } return courses; } }
方法三:深度优先搜索。
public class Solution { private List<Integer>[] depends; private boolean[] visited; private boolean[] satisfied; private int[] courses; private int pos; private boolean find(int course) { if (visited[course]) return satisfied[course]; visited[course] = true; if (depends[course].size() == 0) { courses[pos++] = course; satisfied[course] = true; return true; } for(int depend: depends[course]) if (!find(depend)) return false; courses[pos++] = course; satisfied[course] = true; return true; } public int[] findOrder(int numCourses, int[][] prerequisites) { visited = new boolean[numCourses]; courses = new int[numCourses]; depends = new List[numCourses]; satisfied = new boolean[numCourses]; for(int i=0; i<numCourses; i++) depends[i] = new ArrayList<>(); for(int[] pre: prerequisites) depends[pre[0]].add(pre[1]); for(int i=0; i<numCourses; i++) if (!find(i)) return new int[0]; return courses; } }
相关文章推荐
- python 学习笔记6(数据库 sqlite)
- 【.net 深呼吸】自定义特性(Attribute)的实现与检索方法
- spring四种依赖注入方式
- UNITY 围绕一个物体做圆周运动
- Vim常用配置
- Ubuntu系统配置samba服务
- 一个字符串中只取数字(TRANSLATE,)
- javaWEB 的文件上传功能
- JQuery库:(二)选择器
- Lua编程基础
- new和malloc
- jquery validate
- Xcode 证书问题报错锦集
- vmware
- nginx限制访问速度
- MVC3缓存之一:使用页面缓存
- shaderlab UV动画所需的变量声明
- c# 中基类变量指向派生类对象的实例化
- jsp ,servlet 中文乱码问题
- Swift 中枚举高级用法及实践