中山大学算法课程题目详解(第四周)
来源:互联网 发布:ubuntu制作u盘启动工具 编辑:程序博客网 时间:2024/06/03 05:32
问题描述:
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.
问题解决:
根据老师上课讲过的DFS算法,任意选择一个course,也就是图的任意一个点,然后进行dfs遍历,在遍历过程中如果发现有回边,那么则存在环,返回false,否则,返回true。具体的做法是,给每一个点设置一个状态,状态包括三种:未访问,正在访问,以及已访问。在dfs遍历过程中,如果发现一个正在访问的点访问另外一个访问的点,则可以判断图中存在环,则可返回false。
具体代码如下:
class Solution {public:Solution() {}vector<vector<int> > graph;vector<int> visit;bool dfs(int u) {visit[u] = 1;for (auto v : graph[u]) {if (visit[v] == 1) {return false;}if (dfs(v) == false) {return false;}}visit[u] = 2;return true;}bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {if (numCourses == 0 || prerequisites.empty()) {return true;}graph = vector<vector<int> >(numCourses);visit = vector<int>(numCourses, 0);for (auto i : prerequisites) {graph[i.second].push_back(i.first);}for (int u = 0; u < numCourses; u++) {if (visit[u] == 0 && !dfs(u)) {return false;}}return true;}};
阅读全文
0 0
- 中山大学算法课程题目详解(第四周)
- 中山大学算法课程题目详解(第一周)
- 中山大学算法课程题目详解(第二周)
- 中山大学算法课程题目详解(第三周)
- 中山大学算法课程题目详解(第五周)
- 中山大学算法课程题目详解(第六周)
- 中山大学算法课程题目详解(第七周)
- 中山大学算法课程题目详解(第八周)
- 中山大学算法课程题目详解(第九周)
- 中山大学算法课程题目详解(第十周)
- 中山大学算法课程题目详解(第十一周)
- 中山大学算法课程题目详解(第十二周)
- 算法课程Leetcode作业第四周技术博客
- 算法分析与设计课程作业第四周#1
- 算法第四周作业
- 第四周算法作业
- 第四周算法题
- 博览网C++课程 第四周
- 将数组重新排序以构造最小值-LintCode
- Android 随笔(1)
- Dynamics CRM webresource中的html页面url加参数后浏览报500错的解决方法
- Html学习笔记6:表单
- Ubuntu 16.04安装Docker
- 中山大学算法课程题目详解(第四周)
- Android启动相机拍照、相册选取图片,裁剪图片
- c3P0结合DBUtils操作数据库
- 使用ArrayList集合,对其添加10个不同的元素,并使用Iterator遍历该集合
- mui 启动页和引导页
- 持续集成环境(CI)搭建
- Java学习笔记之IO(一):File类的用法
- GKCompositeBehavior
- 机器学习算法博客