leetcode 207. Course Schedule

最新推荐文章于 2024-11-10 14:06:08 发布

暖焱

最新推荐文章于 2024-11-10 14:06:08 发布

阅读量129

点赞数

分类专栏： # leetcode

本文链接：https://blog.csdn.net/guai7guai11/article/details/120095367

版权

拓扑排序邻接表课程依赖图 BFS

关键词由CSDN通过智能技术生成

leetcode 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

题目

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai.
For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1.
Return true if you can finish all courses. Otherwise, return false.

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:
1 <= numCourses <= 105

0 <= prerequisites.length <= 5000
prerequisites[i].length == 2
0 <= ai, bi < numCourses
All the pairs prerequisites[i] are unique.

题意

已知选修课程的先后顺序，检查是否能够完整修完全部课程

思路

1邻接表存储图中所有边（方便过程中需要对一个顶点的所有出度边遍历）
2拓扑排序
若最后已处理顶点个数==全部顶点个数，则可以完成全部课程
若最后已处理顶点个数<全部顶点个数，则图中有环，课程不能全部完成

题解

class Solution {
public:
    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
        vector<int> map[11000]; //邻接表存储图
        int edegree[11000]={0}; //入度
        queue<int> q; //BFS队列
        int cnt=0; //计数器--入度为0已处理节点个数
        for(int i=0;i<prerequisites.size();i++){
            map[prerequisites[i][0]].push_back(prerequisites[i][1]);//存储边
            edegree[prerequisites[i][1]]++;//入度加一
        }
        //找到入度为0的节点
        for(int i=0;i<numCourses;i++){
            if(edegree[i]==0)q.push(i);
        }
        //拓扑排序
        while(!q.empty()){
            int v = q.front();
            q.pop();
            cnt++;
            for(int i=0;i<map[v].size();i++){
                 //相关节点的入度均减一，若已递减到0，加入BFS队列
                if(--edegree[map[v][i]]==0)q.push(map[v][i]);
            }
        }
        return cnt==numCourses;
    }
};