zoukankan      html  css  js  c++  java
  • [LC] 210. 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.

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

    Time: O(V + E)
    class Solution {
        public int[] findOrder(int numCourses, int[][] prerequisites) {
            int[] indegree = new int[numCourses];
            for (int[] pre: prerequisites) {
                indegree[pre[0]] += 1;
            }
            Queue<Integer> queue = new LinkedList<>();
            int[] res = new int[numCourses];
            int k = 0;
            for (int i = 0; i < indegree.length; i++) {
                if (indegree[i] == 0) {
                    // i represent this course
                    queue.offer(i);
                }
            }
            while (!queue.isEmpty()) {
                int cur = queue.poll();
                res[k++] = cur;
                for (int[] pre: prerequisites) {
                    if (pre[1] == cur) {
                        indegree[pre[0]] -= 1;
                        if (indegree[pre[0]] == 0) {
                            queue.offer(pre[0]);
                        }
                    }
                }
            }
            return k == numCourses ? res: new int[0];
        }
    }
  • 相关阅读:
    RabbitMQ系列教程之一:我们从最简单的事情开始!Hello World(转载)
    如何安装和配置RabbitMQ(转载)
    C++学习笔记-模板
    C++学习笔记-多态的实现原理
    C++学习笔记-多态的实现原理
    C++学习笔记-多态
    C++学习笔记-多态
    C++学习笔记-继承中的构造与析构
    C++学习笔记-继承
    C++学习笔记-封装
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12784516.html
Copyright © 2011-2022 走看看