LeetCode Graph：M210. Course Schedule II

最新推荐文章于 2017-09-25 22:44:30 发布

原创最新推荐文章于 2017-09-25 22:44:30 发布 · 278 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 同时被 3 个专栏收录

30 篇文章

订阅专栏

Graph

8 篇文章

订阅专栏

拓扑

4 篇文章

订阅专栏

本文介绍了一种用于解决课程先修顺序问题的算法。该算法通过拓扑排序的方式确定课程的完成顺序，确保每门课程在其先修课程完成后才能进行。文章提供了一个具体的实现案例，包括如何处理输入数据和实现关键步骤。

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.

click to show more hints.

public class Solution {
    int n;
    int[][] pre;
    public int[] findOrder(int numCourses, int[][] prerequisites) {
        n = numCourses;
        pre = prerequisites;   
        int[] res = new int[n];
        
        if(n==0) return res;
        if(n==1) return res;
        
        //n>1       
        //计算每个点前驱个数
        int m = pre.length;
        int[] nums = new int[n];
        for(int i=0; i<m; i++){
            nums[pre[i][0]]++;
        }
        
        //找到前驱为0的节点，也就是拓扑的的头
        Queue<Integer> q = new LinkedList<Integer>();
        for(int i=0; i<n; i++){
            if(nums[i]==0)
                q.add(i);
        }
        int count = 0;
        while(!q.isEmpty()){
            int t = q.poll();
            res[count] = t;
            count++;
            for(int i=0; i<m; i++){
                int a = pre[i][0];
                int b = pre[i][1];
                if(b==t){
                    nums[a]--;
                    if(nums[a]==0)
                        q.add(a);
                }                    
            }
        }
        if(count==n)
            return res;
        else
            return new int[0];//注意，不能返回null，要返回0长数组，否则报错
    }
}