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].

Note:
    The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
    You may assume that there are no duplicate edges in the input prerequisites.

思路：利用拓扑排序，在AOV网络（AOV网——用顶点表示活动的网络）中选一个没有直接前驱的顶点, 并放入结果集; 从图中删去该顶点, 同时删去所有它发出的有向边;
重复以上步骤,直到：
全部顶点均已输出，拓扑有序序列形成，拓扑排序完成；
或：
图中还有未输出的顶点，但已跳出处理循环。这说明图中还剩下一些顶点，它们都有直接前驱，再也找不到没有前驱的顶点了。这时AOV网络中必定存在有向环。

public class Course_Schedule_II {
	public static int[] findOrder(int numCourses, int[][] prerequisites) 
	{
		int result[] = new int[numCourses];		
		ArrayList<Integer> resultlist = new ArrayList<Integer>();
		//节点i所指向节点的下标
		HashMap<Integer,ArrayList<Integer>> toWard = new HashMap<Integer,ArrayList<Integer>>(); 
		//指向该节点边数目
		int count[] = new int[numCourses];
		
		for(int i=0;i<numCourses;i++)
		{
			ArrayList<Integer> list = new ArrayList<Integer>();
			toWard.put(i,list);
		}
		
		for(int i=0;i<prerequisites.length;i++)
		{
			int prerequisite[] = prerequisites[i];
			count[prerequisite[0]] += 1;
			toWard.get(prerequisite[1]).add(prerequisite[0]);
		}

		ArrayList<Integer> queue = new ArrayList<Integer>();
		
		for(int i=0;i<numCourses;i++)
		{
			if(count[i]==0)
			{
				queue.add(i);				
			}
		}
		
		while(queue.size()>0)
		{			
			int index = queue.get(0);
			resultlist.add(index);
			queue.remove(0);
			ArrayList<Integer> list = toWard.get(index);
			for(int i=0;i<list.size();i++)
			{
				count[list.get(i)] -= 1;
				if(count[list.get(i)]==0)
					queue.add(list.get(i));
			}
			
		}

		if(resultlist.size()<numCourses)
			return new int[]{};
				
		for(int i=0;i<numCourses;i++)
			result[i] = resultlist.get(i);
		
		return result;        
    }
	
	public static void main(String[] args) {
		int numCourses = 10; 
		//[9,8,7,6,5,4,3,2,1,0]
		int[][] prerequisites = {{5,8},{3,5},{1,9},{4,5},{0,2},{7,8},{4,9}};
		int result[] = findOrder(numCourses,prerequisites);
		for(int i=0;i<numCourses;i++)
		{
			System.out.print(result[i]+" ");
		}
	}
}