Question
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].
Solution
Similar with "Course Schedule", the only difference is that we need to record path.
Note: an empty array is the array with length = 0.
1 public class Solution {
2 public int[] findOrder(int numCourses, int[][] prerequisites) {
3 // This problem is to print one possible topological sort result
4 // First, we need to construct a directed graph in the form of adjacency list
5 List<Integer>[] adjacencyList = new ArrayList[numCourses];
6 int[] result = new int[numCourses];
7 int[] degree = new int[numCourses];
8 Arrays.fill(degree, 0);
9 for (int j = 0; j < numCourses; j++) {
10 List<Integer> tmpList = new ArrayList<Integer>();
11 tmpList.add(j);
12 adjacencyList[j] = tmpList;
13 }
14 int length = prerequisites.length;
15 for (int j = 0; j < length; j++) {
16 int[] pair = prerequisites[j];
17 adjacencyList[pair[1]].add(pair[0]);
18 degree[pair[0]]++;
19 }
20
21 // queue is to store nodes with 0 in-degree
22 Queue<Integer> queue = new LinkedList<Integer>();
23 for (int j = 0; j < numCourses; j++) {
24 if (degree[j] == 0)
25 queue.add(j);
26 }
27 if (queue.size() == 0)
28 return new int[0];
29 int i = 0;
30
31 // begin bfs
32 while (queue.size() > 0) {
33 int current = queue.remove();
34 result[i] = current;
35 List<Integer> currentList = adjacencyList[current];
36 for (int j = 1; j < currentList.size(); j++) {
37 int tmp = currentList.get(j);
38 degree[tmp]--;
39 if (degree[tmp] == 0)
40 queue.add(tmp);
41 }
42 i++;
43 }
44 if (i < numCourses)
45 return new int[0];
46 return result;
47 }
48 }