207. Course Schedule

题目

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

For example:

2, [[1,0]]
There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.

2, [[1,0],[0,1]]
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.

思路

这道题就是考察有向图是否有环。 使用BFS，在一个有向图中，每次找到一个没有前驱节点的节点（也就是入度为0的节点），然后把它指向其他节点的边都去掉，重复这个过程（BFS），直到所有节点已被找到，或者没有符合条件的节点（如果图中有环存在）。。

代码

class Solution {
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {

        vector<int> map(numCourses,0);
        for (int i = 0; i < prerequisites.size(); i++) {
            map[prerequisites[i].first]+=1;
        }

        vector<int> que = {};

        for (int i = 0; i < map.size(); i++) {
            if (map[i] == 0) que.push_back(i);
        }

        int count = que.size();
        while (que.size()!=0) {
            int k = que[0];
            que.erase(que.begin());
            for (int i = 0; i < prerequisites.size(); i++) {
                if (k == prerequisites[i].second){
                    int l = prerequisites[i].first;
                map[l]-=1;
                if (map[l] == 0) {
                    que.push_back(l);
                    ++count;
                }
                }
            }
        }
        return count == numCourses;
    }
};