【leetcode】Course Schedule II
来源:互联网 发布:广州高速公路收费软件 编辑:程序博客网 时间:2024/05/17 03:25
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]
.
Submission Result: Wrong Answer
- [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
- Ckeditor通过Ajax更新数据
- IOS开发系列--学习资料整理
- Java NIO系列教程(九) ServerSocketChannel
- sparkR介绍及安装
- eclipse ADT
- 【leetcode】Course Schedule II
- 线性同余方程初步应用分析
- Netty学习
- 黑马程序员--java基础知识点总结
- sed直接替换文件内容
- 微信系列研究之-手把手教你脱掉微信的外衣
- 8大排序算法图文讲解
- SpringMVC学习系列(3) 之 URL请求到Action的映射规则
- CSS文本溢出显示省略号