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

    Note:

    1. The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
    2. You may assume that there are no duplicate edges in the input prerequisites.

    Approach #1: C++.

    class Solution {
    public:
        vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
            vector<unordered_set<int>> graph = make_graph(numCourses, prerequisites);
            
            vector<int> topsort;
            vector<bool> onpath(numCourses, false);
            vector<bool> visited(numCourses, false);
            
            for (int i = 0; i < numCourses; ++i) {
                if (!visited[i] && dfs(graph, i, onpath, visited, topsort))
                    return {};
            }
            
            reverse(topsort.begin(), topsort.end());
            
            return topsort;
        }
        
    private:
        vector<unordered_set<int>> make_graph(int numCourses, vector<pair<int, int>>& prerequisites) {
            vector<unordered_set<int>> graph(numCourses);
            for (auto pre : prerequisites) {
                graph[pre.second].insert(pre.first);
            }
            return graph;
        }
        
        bool dfs(vector<unordered_set<int>>& graph, int node, vector<bool>& onpath, vector<bool>& visited, vector<int>& topsort) {
            if (visited[node]) return false;
            onpath[node] = visited[node] = true;
            for (int neigh : graph[node])
                if (onpath[neigh] || dfs(graph, neigh, onpath, visited, topsort))
                    return true;
            
            topsort.push_back(node);
            return onpath[node] = false;
        }
    };
    

      

    My mood is so bad.

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    【软件测试】3.深入了解软件测试基础day3
    【软件测试】3.深入了解软件测试基础day2
    【软件测试】3.深入了解软件测试基础day1
    【软件测试】3.Linux介绍、命令
    【软件测试】1.软件测试前置基础知识
    玩转数据结构:第8章 优先队列和堆
    一、VIP课程:互联网工程专题 05-快速掌握Jenkins原理与核心功能
    Sublime 一些常用快捷键
    前端01 HTML5
    ios 故事版
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10121784.html
Copyright © 2011-2022 走看看