Course Schedule II

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, return the ordering of courses you should take to finish all courses.

There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.

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 the correct course order is [0,1]

4, [[1,0],[2,0],[3,1],[3,2]]

There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0. So one correct course order is [0,1,2,3]. Another correct ordering is[0,2,1,3].

这道题基于第一题进行一点小小的改动，把每次循环取出的课程放到数组里就可以了。虽然这道题没有题到说可能会出现有环的情况，但是测试集里边有，所以还需要额外加判断，看count是否等于numcourse-1.

代码：

public int[] findOrder(int numCourses, int[][] prerequisites) {
        if(numCourses == 0) return new int[0];
        int [] inDegree = new int[numCourses];
        for(int i=0;i<prerequisites.length;i++){
            inDegree[prerequisites[i][0]]++;
        }
        Queue<Integer> queue = new LinkedList<>();
        //第一批入度为0的kecheng
        for(int i=0;i<inDegree.length;i++){
            if(inDegree[i] == 0){
                queue.offer(i);
            }
        }

        int [] result = new int [numCourses];
        int count = 0;
        while(queue.size() != 0){
            int cur = queue.poll();
            result[count++] = cur;
            inDegree[cur] = -1;
            for(int i=0;i<prerequisites.length;i++){
                if(prerequisites[i][1] == cur){
                    inDegree[prerequisites[i][0]]--;
                    if(inDegree[prerequisites[i][0]] == 0){
                        queue.offer(prerequisites[i][0]);
                    }
                }
            }
        }
        if(count != numCourses){
            return new int[0];
        }
        return result;
    }