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

    Hints:
      1. This problem is equivalent to finding the topological order in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.
      2. Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort.
      3. Topological sort could also be done via BFS.

    紧接着上一题,同样是拓扑序问题。

    class Solution{
    public:
        vector<int> findOrder(int numCourses,vector<pair<int,int>>& prerequisites){
            vector<int> res;
    
            vector<int> in_degree(numCourses,0);
            vector<vector<int>> graph(numCourses);
            for(auto p : prerequisites){
                in_degree[p.first]++;
                graph[p.second].push_back(p.first);
            }
    
            queue<int> q;
            for(int i=0;i<numCourses;i++){
                if(in_degree[i] == 0)
                    q.push(i);
            }
    
            while(!q.empty()){
                int cur = q.front();
                q.pop();
                res.push_back(cur);
                for(auto it = graph[cur].begin();it != graph[cur].end();it++){
                    if(--in_degree[*it] == 0)
                        q.push(*it);
                }
            }
            if(res.size() == numCourses)
                return res;
            else
                return vector<int>();
        }
    };
  • 相关阅读:
    004 cat、head、tail、vim、cp、mv、rm
    003 系统的结构目录、pwd、cd、ls、tree、mkdir、touch
    shell编程
    多线程
    接口(适配器)
    常用方法
    爬虫要具备的准则:
    知识点扫盲篇
    记录_20190628
    记录_20190626
  • 原文地址:https://www.cnblogs.com/wxquare/p/6105462.html
Copyright © 2011-2022 走看看