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

    click to show more hints.

     1 class Solution {
     2 public:
     3     vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
     4         vector<int> res;
     5         vector<vector<int>> graph(numCourses, vector<int>(0));
     6         vector<int> inDegree(numCourses, 0);
     7         for (auto u : prerequisites) {
     8             graph[u.second].push_back(u.first);
     9             ++inDegree[u.first];
    10         }
    11         queue<int> que;
    12         for (int i = 0; i < numCourses; ++i) {
    13             if (inDegree[i] == 0) que.push(i);
    14         }
    15         while (!que.empty()) {
    16             int u = que.front();
    17             res.push_back(u);
    18             que.pop();
    19             for (auto v : graph[u]) {
    20                 --inDegree[v];
    21                 if (inDegree[v] == 0) que.push(v);
    22             }
    23         }
    24         if (res.size() != numCourses) res.clear();
    25         return res;
    26     }
    27 };
  • 相关阅读:
    (Problem 14)Longest Collatz sequence
    (Problem 13)Large sum
    (Problem 10)Summation of primes
    (Problem 9)Special Pythagorean triplet
    (Problem 7)10001st prime
    (Problem 6)Sum square difference
    数组
    断点及复习
    抽象和封装
    类和对象
  • 原文地址:https://www.cnblogs.com/easonliu/p/4502202.html
Copyright © 2011-2022 走看看