210. Course Schedule II

There are a total ofncourses you have to take, labeled from0ton - 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 prerequisitepairs, 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].

Analysis:

Checkout "LC 207 Course Schedule" for detail, its just topological sort.

Code:

public class Solution {
    public int[] findOrder(int numCourses, int[][] prerequisites) {
        if(numCourses <= 1)
        {
            return new int[1];
        }

        //build Graph 
        List<List<Integer>> graph = new ArrayList<List<Integer>>(numCourses);
        int[] inD = new int[numCourses];
        int inDegree = 0;
        for(int i = 0; i<numCourses; i++)
        {
            graph.add(new LinkedList<Integer>());
        }

        for(int[] edge : prerequisites)
        {
            graph.get(edge[1]).add(edge[0]);
            inD[edge[0]]++;
            inDegree++;
        }

        Deque<Integer> queue = new LinkedList<Integer>();
        for(int i = 0; i < numCourses; i++)
        {
            if(inD[i] == 0)
            {
                queue.add(i);
            }
        }

        int[] returnArray = new int[numCourses];
        int index = 0;
        while(!queue.isEmpty())
        {
            Integer courseTaken = queue.poll();
            returnArray[index++] = courseTaken;
            for(Integer itr : graph.get(courseTaken))
            {
                inD[itr]--;
                inDegree--;
                if(inD[itr] == 0)
                {
                    queue.offer(itr);
                }
            }
        }

        return inDegree == 0 ? returnArray : new int[0];
    }
}