第十二周 leetcode 207. Course Schedule(Medium)
来源:互联网 发布:linux 加载u盘 编辑:程序博客网 时间:2024/06/06 06:38
题目描述:
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.
解题思路:
拓扑排序流程:
1.从 DAG 图中选择一个 没有前驱(即入度为0)的顶点并输出。
2.从图中删除该顶点和所有以它为起点的有向边。
3.重复 1 和 2 直到当前的 DAG 图为空或当前图中不存在无前驱的顶点为止。
代码:
class Solution {public: bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) { vector<vector<int>> E(numCourses); int num = prerequisites.size(); // record indegree vector<int> indegree(numCourses, 0); for (int i = 0; i < num; i++) { pair<int, int> p = prerequisites[i]; indegree[p.first]++; E[p.second].push_back(p.first); } // find points s.t. indegree=0 queue<int> que; for (int i = 0; i < numCourses; i++) { if (indegree[i] == 0) que.push(i); } int count = 0; while (!que.empty()) { int temp = que.front(); que.pop(); count++; for (auto st : E[temp]) { if (indegree[st] == 1) que.push(st); indegree[st]--; } } return count == numCourses; }};
代码运行结果:
- 第十二周 leetcode 207. Course Schedule(Medium)
- 【LeetCode】207. Course Schedule (Medium)
- LeetCode 207. Course Schedule [Medium]
- 207. Course Schedule Medium
- [Leetcode 207, Medium] Course Schedule
- LeetCode #207 - Course Schedule - Medium
- 207. Course Schedule (Medium)&& 210. Course Schedule II(Medium)
- Leetcode解题笔记 207.Course Schedule [Medium] 拓扑排序
- [Leetcode 270, Medium] Course Schedule II
- 【LeetCode】210. Course Schedule II (Medium)
- LeetCode #210 - Course Schedule II - Medium
- [leetcode] 207.Course Schedule
- Leetcode 207. Course Schedule
- 207. Course Schedule LeetCode
- leetcode 207. Course Schedule
- leetcode.207. Course Schedule
- LeetCode 207. Course Schedule
- 【LeetCode】207. Course Schedule
- Excel比较工具SpreadSheet
- Android开发中如何设置字体
- 【PAT】【Advanced Level】1014. Waiting in Line (30)
- sort
- POJ1731 Orders【全排列+字符串排序】
- 第十二周 leetcode 207. Course Schedule(Medium)
- Python tcp编程,TCP服务端和TCP客户端代码编写
- Guide for camera usage in DB410c(1)
- REDIS (13) 并发使用Jedis原理分析
- 设计模式-行为型软件设计模式(四)
- 在Linux系统部署InfluxDB
- FZUOJ 2250 不可能弹幕结界【BFS】
- 光栅图形学算法——裁剪算法
- 设计模式-行为型软件设计模式(五)