zoukankan      html  css  js  c++  java
  • 210. Course Schedule II

    https://leetcode.com/problems/course-schedule-ii/#/description

    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:

    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.

    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.

    Sol 1:

    BFS. 

    import collections
    class Solution(object):
        def findOrder(self, numCourses, prerequisites):
            """
            :type numCourses: int
            :type prerequisites: List[List[int]]
            :rtype: List[int]
            """
            # bfs
            
            dic = {i: set() for i in range(numCourses)}
            neigh = collections.defaultdict(set)
            for i, j in prerequisites:
                dic[i].add(j)
                neigh[j].add(i)
            # queue stores the courses which have no prerequisites
            
            queue = collections.deque([i for i in dic if not dic[i]])
            count, res = 0, []
            while queue:
                # examine each node from queue 
                node = queue.popleft()
                res.append(node)
                count += 1
                # for each neighbors of the node
                for i in neigh[node]:
                    # remove the prerequisites of this course i 
                    dic[i].remove(node)
                    # if course i does not have any prerequisites, append it to queue
                    if not dic[i]:
                        queue.append(i)
                        
            if count == numCourses:
                return res
            else:
                return []
                    

    Sol 2 :

    DFS

    import collections
    class Solution(object):
        def findOrder(self, numCourses, prerequisites):
            """
            :type numCourses: int
            :type prerequisites: List[List[int]]
            :rtype: List[int]
            """
            # dfs
            
            dic = collections.defaultdict(set)
            neigh = collections.defaultdict(set)
            for i, j in prerequisites:
                dic[i].add(j)
                neigh[j].add(i)
            # stack stores the courses which have no prerequisites
            
            stack = [i for i in range(numCourses) if not dic[i]]
            res = []
            while stack:
                # examine each node from queue 
                node = stack.pop()
                res.append(node)
                # for each neighbors of the node
                for i in neigh[node]:
                    # remove the prerequisites of this course i 
                    dic[i].remove(node)
                    # if course i does not have any prerequisites, append it to stack
                    if not dic[i]:
                        stack.append(i)
                dic.pop(node)
                        
            if not dic:
                return res
            else:
                return []
                    
  • 相关阅读:
    有一天人人都会变成程序猿
    mysql 假设存在id则设数据自添加1 ,不存在则加入。java月份计算比較
    做程序员的老婆应该注意的一些事情
    人类科技的发展为什么会是加速度的(TRIZ方法再推荐)
    Unity5.0 RPG角色扮演历险类游戏之 森林历险记
    linux目录对照命令——meld
    iOS --- [持续更新中] iOS移动开发中的优质资源
    【spring bean】spring中bean的懒加载和depends-on属性设置
    【spring bean】 spring中bean之间的引用以及内部bean
    【spring set注入 注入集合】 使用set注入的方式注入List集合和Map集合/将一个bean注入另一个Bean
  • 原文地址:https://www.cnblogs.com/prmlab/p/7229801.html
Copyright © 2011-2022 走看看