[Leetcode] 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.

click to show more hints.

拓扑排序。用一个队列存入度为0的节点，依次出队，将与出队节点相连的节点的入度减1，如果入度减为0，将其放入队列中，直到队列为空。如里最后还有入度不为0的节点的话，说明有环，否则无环。

 class Solution {
 public:
     bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
         vector<vector<int>> graph(numCourses, vector<int>());
         vector<int> inDegree(numCourses, );
         for (auto u : prerequisites) {
             graph[u[]].push_back(u[]);
             ++inDegree[u[]];
         }
         queue<int> que;
         for (int i = ; i < numCourses; ++i) {
             if (inDegree[i] == ) que.push(i);
         }
         while (!que.empty()) {
             int u = que.front();
             que.pop();
             for (auto v : graph[u]) {
                 --inDegree[v];
                 if (inDegree[v] == ) que.push(v);
             }
         }
         for (int i = ; i < numCourses; ++i) {
             if (inDegree[i] != ) return false;
         }
         return true;
     }
 };