leetcode【207】【Depth-first Search】Course Schedule【c++版本】

最新推荐文章于 2025-05-14 17:02:27 发布

凡凡.cs

最新推荐文章于 2025-05-14 17:02:27 发布

阅读量198

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/fanyuwgy/article/details/111151616

本文探讨了如何判断一组课程是否能够顺利完成的问题。通过分析课程先决条件，利用深度优先搜索（DFS）来检测是否存在学习顺序上的闭环，进而确定所有课程是否可以按要求修读完毕。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Hello，各位，我又回来了。做了一学期废物，这赶紧回来找找感觉了。

问题描述：

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.

源码：

分析了一下题目，有点像数据结构中的拓扑排序。

思路就是用DFS的方法找一下给出的prerequisites中是否有环，有的话就不行，没有的话就返回True。

用visitnum表示访问序列中曾经出现过的元素，若当前元素在visitnum中则说明存在环。

visit [i] = true 表示以prerequisites中第 i 个pair为开头的序列已经访问过了，无需再访问。

class Solution {
public:
    bool candp(vector<vector<int>>& prerequisites, vector<bool>& visitnum, vector<bool>& visit, int index) {
        visit[index] = true;
        visitnum[prerequisites[index][0]] = true;
        for (int i=0; i<prerequisites.size(); i++){
            if (i == index) {
                continue;
            }
            if (prerequisites[i][0] == prerequisites[index][1]) {
                if (visitnum[prerequisites[i][1]]) {
                    return false;
                }
                if (!visit[i]) {
                    if (!candp(prerequisites, visitnum, visit, i)) {
                        return false;
                    }
                }
            }
        }
        visitnum[prerequisites[index][0]] = false;
        return true;
    }
    
    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
        if (prerequisites.size() == 0) {
            return true;
        }
        vector<bool> visit(prerequisites.size(), false);
        vector<bool> visitnum(numCourses, false);
        for (int i=0; i<prerequisites.size(); i++){
            if (!visit[i]) {
                if (!candp(prerequisites, visitnum, visit, i)) {
                    return false;
                }
            }
        }
        return true;
    }
};