[LeetCode] 210. Course Schedule II

zhkai 发布于2019-08-19 11:12 / 3160人阅读

Problem

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.

Example 1:

Input: 2, [[1,0]] 
Output: [0,1]

Explanation: 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] .
Example 2:

Input: 4, [[1,0],[2,0],[3,1],[3,2]]
Output: [0,1,2,3] or [0,2,1,3]

Explanation: 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.

Solution

class Solution {
    public int[] findOrder(int numCourses, int[][] prerequisites) {
        int[] degree = new int[numCourses];
        Map> map = new HashMap<>();
        for (int[] pair: prerequisites) {
            int parent = pair[1], child = pair[0];
            if (!map.containsKey(parent)) {
                List list = new ArrayList<>();
                list.add(child);
                map.put(parent, list);
            } else map.get(parent).add(child);
            degree[child]++;
        }
        
        Queue queue = new LinkedList<>();
        for (int i = 0; i < degree.length; i++) {
            if (degree[i] == 0) queue.offer(i);
        }
        
        int[] res = new int[numCourses];
        int k = 0;
        
        while (!queue.isEmpty()) {
            int parent = queue.poll();
            res[k++] = parent;
            if (map.containsKey(parent)) {
                for (int child: map.get(parent)) {
                    degree[child]--;
                    if (degree[child] == 0) queue.offer(child);
                }
            }
        }
        
        if (k != numCourses) return new int[0];
        return res;
    }
}

云服务器混合云 Course rds210 LeetCode Schedule

文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。

转载请注明本文地址：https://www.ucloud.cn/yun/77201.html

210. Course Schedule II

摘要：建立入度组成，把原来输入的无规律，转换成另一种表示图的方法。找到为零的点，放到里，也就是我们图的入口。对于它的也就是指向的。如果这些的入度也变成，也就变成了新的入口，加入到里，重复返回结果。这里题目有可能没有预修课，可以直接上任意课程。 Some courses may have prerequisites, for example to take course 0 you have ...

lbool 2019-08-16 10:36 评论0 收藏0
[LeetCode/LintCode] Course Schedule II

Problem 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 a...

Lavender 2019-08-15 17:49 评论0 收藏0
[Leetcode] Course Schedule 课程计划

Course Schedule I 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 e...

Amio 2019-08-14 12:40 评论0 收藏0
【LC总结】图、拓扑排序 (Course Schedule I, II/Alien Dictiona

Course Schedule Problem 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, whi...

gaara 2019-08-14 15:54 评论0 收藏0
[LeetCode] 207. Course Schedule

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

ephererid 2019-08-15 17:47 评论0 收藏0