LeetCode 29 May, Course Schedule,判断是否选课冲突

最新推荐文章于 2023-12-27 21:22:13 发布

大象漫步

最新推荐文章于 2023-12-27 21:22:13 发布

阅读量365

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_46391502/article/details/106460486

版权

给定课程总数和先修课关系，分析有向图是否存在环，以确定能否完成所有课程。通过深度优先搜索判断，过程中标记节点状态，遇到环则返回False，无环则返回True。

摘要由CSDN通过智能技术生成

Course Schedule

There are a total of numCourses courses you have to take, labeled from 0 to numCourses-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?

Example 1:

Input: numCourses = 2, prerequisites = [[1,0]]
Output: true
Explanation: There are a total of 2 courses to take. 
             To take course 1 you should have finished course 0. So it is possible.

Example 2:

Input: numCourses = 2, prerequisites = [[1,0],[0,1]]
Output: false
Explanation: 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.

Constraints:

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