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

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

    思想:拓扑排序,入度为0的点入队。

    代码如下:

    public class Solution {
        public int[] findOrder(int numCourses, int[][] prerequisites) {
           int[] ret=new int[numCourses];
           int []inDegree=new int[numCourses];
           int len=prerequisites.length;
           //找到入度为0的节点
           for(int i=0;i<len;i++){
               inDegree[prerequisites[i][0]]++;
           }
           Queue<Integer>q=new LinkedList<Integer>();
           for(int i=0;i<numCourses;i++){
               if(inDegree[i]==0)
                   q.offer(i);
           }
           int i=-1;
           while(!q.isEmpty()){
               int e=q.poll();
               ret[++i]=e;
               for(int j=0;j<len;j++){
                  if(prerequisites[j][1]==e){
                     if(--inDegree[prerequisites[j][0]]==0)
                         q.offer(prerequisites[j][0]);
                  }
                  
               }
           }
           if(i==numCourses-1)
               return ret;
            else
            return new int[0];
           
       }
     
    }
    

      

     运行结果:

     

  • 相关阅读:
    负载均衡的基础技术种类
    scp基本使用方法
    给linux添加yum源。
    Linux 克隆虚拟机引起的“Device eth0 does not seem to be present, delaying initialization”
    FastDFS-单机版安装
    已安装nginx动态添加模块
    FastDFS
    七、CentOS 6.5 下 Nginx的反向代理和负载均衡的实现
    www.xxx.com 与 m.xxx.com 的Nginx服务器实现
    六、CentOS 6.5 下Nginx的配置
  • 原文地址:https://www.cnblogs.com/mlz-2019/p/4716433.html
Copyright © 2011-2022 走看看