[leetcode] Course Schedule II
2015-06-23 15:41
429 查看
From : 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
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].
class Solution { public: vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) { vector<int> ans; vector<set<int>> posts(numCourses, set<int>()); vector<int> preNums(numCourses, 0); for(auto &ab : prerequisites) posts[ab.second].insert(ab.first); for(int i=posts.size()-1; i>=0; i--) { for(auto &nd : posts[i]) { preNums[nd]++; } } int num = numCourses; queue<int> q; for(int i=0; i<num; i++) { if(preNums[i] == 0) q.push(i); } while(!q.empty()) { int k = q.front(); q.pop(); ans.push_back(k); for(auto &a : posts[k]) { if(--preNums[a] == 0) { q.push(a); } } num--; } if(num > 0) ans.clear(); return ans; } };
相关文章推荐
- js与php之间互传中文汉字
- PinYin4Objc开源项目代码解读
- 在MySQL command line client 中使用 mysqldump问题
- Oracle 索引组织表 IOT
- 复制块
- Learning Spark 学习笔记 第五章 加载或保存数据
- 模仿探探的左右滑动切换卡片功能
- C++ 在Ring3下的通用API HOOK
- vs2008,2010,2012安装包下载
- zoj 3622 Magic Number(找规律)
- 使用Jenkins配置自动化构建
- Android Studio 常见问题
- Oracle 锁管理
- 嵌入式linux下如何使用usb键盘
- 使用nRF51822/nRF51422创建一个简单的BLE应用 ---入门实例手册(中文)之二
- URL与资源
- Win8电脑全屏玩游戏的两种方法(默认是无法全屏的)
- JAVA部分关键字分析
- 7-zip命令行
- 一种高效的寻路算法——B*寻路算法