课程学习前提约束（拓扑排序练习）

wniuniu_

于 2024-07-30 16:30:43 发布

阅读量45

点赞数

分类专栏：算法文章标签：学习

本文链接：https://blog.csdn.net/wniuniu_/article/details/140798252

版权

算法专栏收录该内容

110 篇文章 1 订阅

订阅专栏

在这里插入图片描述

很显然的拓扑排序

class Solution {
public:
    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
        int n = numCourses;
        vector<int> record(n+1,0);
        queue<int> q;
        vector<vector<int>> graph(n + 1);
        for (int i = 0; i < prerequisites.size(); i++) {
            int now = prerequisites[i][0];
            for (int j = 1; j < prerequisites[i].size();j++) {
                record[now]++;
                graph[prerequisites[i][j]].push_back(now);  // 还是建一个图吧
            }
            //if(record[now]==0) q.push(now);
        }
        for (int i = 0; i < n; i++) {
            if (record[i] == 0) q.push(i);
        }
        if (q.size() == 0) return false;
        int cnt = 0;
        vector<int> vis(n + 1, 0);
        while (q.size())
        {
            int u = q.front(); q.pop();
            if (vis[u]) continue;
            vis[u] = 1; cnt++;
            for (auto v : graph[u]) {
                record[v]--; if (record[v] == 0) q.push(v);
            }
        }
        return cnt == n;
    }
    
};