207. Course Schedule
来源:互联网 发布:在淘宝怎么看咸鱼 编辑:程序博客网 时间:2024/06/07 08:01
Description:
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.
Note:
- The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
- You may assume that there are no duplicate edges in the input prerequisites.
click to show more hints.
- This problem is equivalent to finding if a cycle exists 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.
简要题解:
可以把问题转化为有向图的问题。课程代表图中的结点,课程之间的先后关系用图中的边表示。
为了直观方便,这里[v, u]用从v到u的边表示。(逻辑上,应该用从u到v的边表示,但这里不影响最终判断)
如果可以对图中的结点进行拓扑排序,则说明可以按照要求完成所有课程。
有向图中的结点能进行拓扑排序当且仅当图中没有圈。
而在一个dag中每一个边指向一个更小的post(后访问时刻)值
因此,可以通过一个dfs,然后判断prerequisite pairs中有没有存在边(v, u)使得post[v] < post[u],如果存在,则返回false;反之,返回true
代码:
class Solution {private: bool* visited; int* post; int clock;public: void postvisit(int v) { post[v] = clock++; } void explore(int v, vector<pair<int, int>>& prerequisites) { visited[v] = true; for (int i = 0; i < prerequisites.size(); i++) if (prerequisites[i].first == v && !visited[prerequisites[i].second]) explore(prerequisites[i].second, prerequisites); postvisit(v); } void dfs(int numCourses, vector<pair<int, int>>& prerequisites) { if (visited != NULL) delete[] visited; visited = new bool[numCourses]; for (int i = 0; i < numCourses; i++) visited[i] = false; if (post != NULL) delete[] post; post = new int[numCourses]; clock = 0; for (int i = 0; i < numCourses; i++) if (!visited[i]) explore(i, prerequisites); } bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) { dfs(numCourses, prerequisites); for (int i = 0; i < prerequisites.size(); i++) if (post[prerequisites[i].first] < post[prerequisites[i].second]) return false; if (visited != NULL) delete[] visited; if (post != NULL) delete[] post; return true; }};
- [leetcode] 207.Course Schedule
- 207.Course Schedule
- Leetcode 207. Course Schedule
- 207. Course Schedule
- 207. Course Schedule LeetCode
- 207. Course Schedule
- leetcode 207. Course Schedule
- 207. Course Schedule
- leetcode.207. Course Schedule
- LeetCode 207. Course Schedule
- 【LeetCode】207. Course Schedule
- 207. Course Schedule
- 207. Course Schedule
- 207. Course Schedule
- [leetcode] 207. Course Schedule
- leetcode-207. Course Schedule
- 207. Course Schedule
- 207. Course Schedule
- Java反射初探 ——“当类也学会照镜子”
- 重置密码解决MySQL for Linux错误 ERROR 1045 (28000): Access denied for user 'root'@'localhost' (using passwor
- C语言 输入字符串,按照宏定义形式输出相应字符串
- 递归与循环的优缺点
- 轮式移动机器人基础及滑模控制仿真
- 207. Course Schedule
- unity常用方法
- HTML DOM学习笔记(三)_常用DOM 属性
- eclipse 快捷键(二)
- 模拟CAS算法
- hibernate criteria 多表关联查询
- LWC 51:683. K Empty Slots
- PSO优化SVM多分类器的参数实例
- llvm:Call Graph And Control Flow Graph