力扣刷题207课程表

最新推荐文章于 2024-05-28 15:08:53 发布

weixin_41834810

最新推荐文章于 2024-05-28 15:08:53 发布

阅读量151

点赞数

分类专栏：力扣刷题文章标签： leetcode 力扣 c++

本文链接：https://blog.csdn.net/weixin_41834810/article/details/125353779

版权

力扣刷题专栏收录该内容

6 篇文章 0 订阅

订阅专栏

广度优先搜索

难度中等

bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
    vector<int> inDegree(numCourses, 0);
    vector<vector<int>> map(numCourses);
    for (int i = 0; i < prerequisites.size(); ++i) {
        ++inDegree[prerequisites[i][0]];
        map[prerequisites[i][1]].push_back(prerequisites[i][0]);
    }
    queue<int> que;
    for (int i = 0; i < numCourses; ++i) {
        if (inDegree[i] == 0)
            que.push(i);
    }
    int res = 0;
    while (que.size()) {
        int localCourse = que.front();
        que.pop();
        ++res;
        for (int j = 0; j < map[localCourse].size(); ++j) {
            --inDegree[map[localCourse][j]];
            if (inDegree[map[localCourse][j]] == 0)
                que.push(map[localCourse][j]);
        }
    }
    return res == numCourses;
}