[Leetcode] #207#210 Course Schedule I & II (BFS)
来源:互联网 发布:大智慧mac版使用教程 编辑:程序博客网 时间:2024/06/05 10:27
Discription:
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, is it possible for you to finish all courses?
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 it is possible.
2, [[1,0],[0,1]]
There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.
Solution:
//BFS 类似拓扑排序 看有木有环bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {vector<int> map(numCourses, 0);int len = prerequisites.size();for (int i = 0; i < len; i++){map[prerequisites[i].first]++;}queue<int> que;for (int i = 0; i < map.size(); i++){if (map[i] == 0)que.push(i);}int count = que.size();while (!que.empty()){int x = que.front();que.pop();for (int i = 0; i < len; i++){if (prerequisites[i].second == x){int y = prerequisites[i].first;map[y]--;if (!map[y]){que.push(y);count++;}}}}return count == numCourses;}
Discription:
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]
.
Solution:
//BFS 类似拓扑排序 看有木有环vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {vector<int> map(numCourses, 0);int len = prerequisites.size();for (int i = 0; i < len; i++){map[prerequisites[i].first]++;}queue<int> que;for (int i = 0; i < map.size(); i++){if (map[i] == 0)que.push(i);}vector<int> result;int count = que.size();while (!que.empty()){int x = que.front();result.push_back(x);que.pop();for (int i = 0; i < len; i++){if (prerequisites[i].second == x){int y = prerequisites[i].first;map[y]--;if (!map[y]){que.push(y);count++;}}}}if (count != numCourses)return{};elsereturn result;}
- [Leetcode] #207#210 Course Schedule I & II (BFS)
- Leetcode(207)Course Schedule (210)Course Schedule II
- 207Course Schedule 210Course Schedule II
- Course Schedule I II LeetCode Java
- leetcode -- Course Schedule I && II -- TopSort重点
- LeetCode 210 - Course Schedule II
- leetcode 210: Course Schedule II
- 【Leetcode】Course Schedule II #210
- leetcode 210: Course Schedule II
- LeetCode 210 Course Schedule II
- LeetCode 210 Course Schedule II
- Leetcode-210: Course Schedule II
- LeetCode 210 Course Schedule II
- LeetCode 210 Course Schedule II
- Course Schedule I&II
- LeetCode Course Schedule BFS
- Leetcode 210 Course Schedule II 课程表II
- [leetcode]Course Schedule II
- Grails 配置
- 413. Arithmetic Slices
- (三)数组中存储对象
- C#中的深复制和浅复制(在C#中克隆对象)
- 【Redis笔记-0】Install Redis3.0 on Ubuntu
- [Leetcode] #207#210 Course Schedule I & II (BFS)
- angularJS入门与进阶(笔记1)
- xgboost用于文本分类预测,java接口
- 【笔记】蓝牙BLE的简单总结
- 树的建立与基本操作
- 练习
- 人脸检测(三)
- Medical Image Segmentation Using New Hybrid Level-Set Method
- 给出01数组计算出符合岛屿规则的个数 [牛客网-滴滴出行2017春招算法工程师笔试题B卷 ]