207-课程表

拓扑排序！！

class Solution {
    public boolean canFinish(int numCourses, int[][] prerequisites) {
        //拓扑排序判断有向无环图！！！
        List<List<Integer>> edges = new ArrayList<>();//邻接表
        for(int i = 0;i < numCourses;i++){
            edges.add(new ArrayList<Integer>());//下标即为前驱节点编号
        }
        int[] degree = new int[numCourses];//入度表
        for(int[] info : prerequisites){
            edges.get(info[1]).add(info[0]); //edge[i]中即为i指向的节点           
            degree[info[0]]++;
        }
        Deque<Integer> queue = new LinkedList<>();
        for(int i = 0;i < degree.length;i++){
            if(degree[i] == 0){
                queue.add(i);
            }
        }
        int visited = 0;
        while(!queue.isEmpty()){
            int u = queue.poll();
            visited++;//这里用列表存储即可获得拓扑排序序列
            for(int v : edges.get(u)){
                degree[v]--;
                if(degree[v] == 0){
                    queue.offer(v);
                }
            }

        }
        return visited == numCourses;
    }
}