Course Schedule II
2015-06-19 04:20
423 查看
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.
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.
The solution of this problem is just a little different from the course schedule 1. If you have problems, please refer to the course schedule 1.
public class Solution { public int[] findOrder(int numCourses, int[][] prerequisites) { int[] ret = new int[numCourses]; Queue<Integer> queue = new LinkedList<Integer>(); if (numCourses <= 0) return ret; int j = 0; int[] counter = new int[numCourses]; int len = prerequisites.length; for (int i = 0; i < len; i++) { counter[prerequisites[i][0]]++; } for (int i = 0; i < numCourses; i++) { if (counter[i] == 0) { ret[j++] = i; queue.add(i); } } while (!queue.isEmpty()) { int top = queue.poll(); for (int i = 0; i < len; i++) { if (prerequisites[i][1] == top) { counter[prerequisites[i][0]]--; if (counter[prerequisites[i][0]] == 0) { queue.add(prerequisites[i][0]); ret[j++] = prerequisites[i][0]; } } } } if (j != numCourses) return new int[]{}; return ret; } }
相关文章推荐
- 思科加强生成树性能的属性(Portfast /Uplinkfast/BackboneFast)与RSTP的关系 推荐
- Python学习笔记(2)---Python杂记
- 为什么日文中有汉字?
- 硅谷跳槽工具箱指南
- Course Schedule
- sklearn(scikit-learn)快速入门【Python实现】
- c++命名空间使用
- 黑马程序员_网络编程2
- 响应式设计-VS-REM布局
- 2015届华为校园招聘机试题<第三题等式变换>
- [LeetCode] LRU Cache 缓存器
- Python学习笔记(1)--python语言Web开发框架web2py
- 韩梦音乐第一弹
- Redis 之 Jedis(1)
- Nancy和ASP.NET MVC的简单对比
- Netty权威指南之NIO入门
- 「深入 Exchange 2013」01 客户端访问角色架构
- kvm xen 之区别
- 我给自己的Sass+Compass,在Windows下写个bat,快速cd到我的sass目录
- Cygwin使用方法