晨哥Leetcode 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:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
You may assume that there are no duplicate edges in the input prerequisites.

拓扑排序基本套路
第一步，建立degree数组，统计每个数的需要多少个前置的先修课程，degree为0就是不需要任何先修课程，直接可以上的课
第二步，把依赖关系记下来，edges[i] 存的是依赖于i这门课的都有哪些课
为什么不是反过来存呢？这样存的目的是当i这门课上完以后，我方便去查找哪些课的degree可以减一了。i是被依赖的课，所有依赖i的都存在edges[i]里, 当i被上了以后，也就是所有依赖i的课，都已经减少了一个依赖
第三步，先把所有degree为0,没有任何依赖的课都放到一个队列里去
第四步, 一个个从队列里取出课来上，每上完一门课，都把依赖于这个课的其他课degree -1， 那么当degree为0时，又可以加入到队列里去了

每上完一门课计数，count == courses number, 就是所有课都能上完

注意list[]的初始化
for(int i = 0; i<k; i++) {
edges[i] = new ArrayList(); //必须要这样初始化, Arrays.fill(edges, new ArrayList()) 是不对的，所有的元素都会指向同一个list对象
}

public boolean canFinish(int k, int[][] pre) {
        int[] degree = new int[k]; //degree数组，统计每个数的需要多少个前置的先修课程，degree为0就是不需要任何先修课程，直接可以上的课
        List[] edges= new ArrayList[k]; //list[] 这种操作有点意思，不过不方便加泛型
        for(int i = 0; i<k; i++) {
            edges[i] = new ArrayList(); //必须要这样初始化, Arrays.fill(edges, new ArrayList()) 是不对的，所有的元素都会指向同一个list对象
        }
        for(int[] cur: pre) {
            degree[cur[0]]++;
            edges[cur[1]].add(cur[0]); //理清关系就行
        }
        Queue<Integer> q = new LinkedList();
        for(int i = 0; i < k; i++) {
            if(degree[i] == 0) {
                q.offer(i);
            }
        }
        int count = 0;
        while(!q.isEmpty()) {
            Integer course = q.poll();
            count++;
            for(Object o : edges[course]) { //取出时做类型转换          
                int cur = (Integer)o;
                if(--degree[cur] == 0) {
                    q.offer(cur);
                }
            }
        }
        return count == k;
    }