207.课程表

207.课程表

题解

​ 用数组记录每个课程的入读，如果某课程的入读为0，把课程推进队列。将队列课程逐一推出，则将需要该课程的课程入度减一，若入读为0，则又将该课程推进队列。将当队列为空，若课程数等于推出数，则为true，否则为false。

class Solution {
    
    
    List<List<Integer>> edges;
    int[] indeg;

    public boolean canFinish(int numCourses, int[][] prerequisites) {
    
    
        edges = new ArrayList<List<Integer>>();
        for (int i = 0; i < numCourses; ++i) {
    
    
            edges.add(new ArrayList<Integer>());
        }
        indeg = new int[numCourses];
        for (int[] info : prerequisites) {
    
    
            edges.get(info[1]).add(info[0]);
            ++indeg[info[0]];
        }

        Queue<Integer> queue = new LinkedList<Integer>();
        for (int i = 0; i < numCourses; ++i) {
    
    
            if (indeg[i] == 0) {
    
    
                queue.offer(i);
            }
        }

        int visited = 0;
        while (!queue.isEmpty()) {
    
    
            ++visited;
            int u = queue.poll();
            for (int v: edges.get(u)) {
    
    
                --indeg[v];
                if (indeg[v] == 0) {
    
    
                    queue.offer(v);
                }
            }
        }

        return visited == numCourses;
    }
}