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?

Example 1:

Input: 2, [[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: 2, [[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.

Note:

1. The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
2. You may assume that there are no duplicate edges in the input prerequisites.

思路：拓扑排序（Kahn 算法，其实就是广度优先遍历的思路）

在代码具体实现的时候，除了保存入度为 0 的队列，我们还需要两个辅助的数据结构：

1、邻接表：通过结点的索引，我们能够得到这个结点的后继结点；

2、入度数组：通过结点的索引，我们能够得到指向这个结点的结点个数。

class Solution {
public:
    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
        vector<int> inDegree(numCourses, 0);
        vector<vector<int>> lst(numCourses, vector<int>());
        for (auto v : prerequisites)
        {
            inDegree[v[0]]++;	// 初始化入度列表
            lst[v[1]].push_back(v[0]);	// 初始化邻接表
        }

        queue<int> que;
        for (auto i = 0; i < inDegree.size(); i++)
        {
            if (inDegree[i] == 0) que.push(i);	// 将入度为0的结点放入队列
        }

        vector<int> ans;
        while (!que.empty())
        {
            // 将入度为0的进行出队，那就是每次出一个呗
            auto q = que.front();
            que.pop();
            ans.push_back(q);

            for (auto l : lst[q])
            {
                if (--inDegree[l] == 0) que.push(l);
            }
        }
        return ans.size() == numCourses;
    }
};