leetcode:Course Schedule

Course Schedule Total Accepted: 2492 Total Submissions: 12389 My Submissions Question Solution
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.

Note:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.

题目的要求是判断一个有向图是不是有环，没有环可以完成课程，有环就不可以完成课程

public class Solution {
    public boolean canFinish(int numCourses, int[][] prerequisites) {
        ArrayList<ArrayList<Integer> > graph = new ArrayList<ArrayList<Integer> >();

        HashSet<Integer> in = new HashSet<>();
        int[] inNum = new int[numCourses];
        boolean flag = false;

        for(int i = 0; i < numCourses; ++i){
            graph.add(new ArrayList<Integer>());
            in.add(i);
        }
        for(int i = 0; i < prerequisites.length; ++i){
            int a = prerequisites[i][0];
            int b = prerequisites[i][1];

            in.remove(b);
            inNum[b]++;
            graph.get(a).add(b);
        }
        if(in.size() == 0){
            return false;
        }
        LinkedList<Integer> queue = new LinkedList<>(in);
        while(!queue.isEmpty()){
            Integer ins = queue.getFirst();
            ArrayList<Integer> list = graph.get(ins);
            for(int g : list){
                inNum[g]--;
                if(inNum[g] == 0){
                    queue.addLast(g);
                }
            }
            queue.removeFirst();
        }
        for(int i = 0; i < numCourses; ++i){
            if(inNum[i] > 0)return false;
        }
        return true;

    }
}