zoukankan      html  css  js  c++  java
  • Jump Game II

    Given an array of non-negative integers, you are initially positioned at the first index of the array.
    
    Each element in the array represents your maximum jump length at that position.
    
    Your goal is to reach the last index in the minimum number of jumps.
    
    Have you met this question in a real interview? Yes
    Example
    Given array A = [2,3,1,1,4]
    
    The minimum number of jumps to reach the last index is 2. (Jump 1 step from index 0 to 1, 
    then 3 steps to the last index.)
    public int jump(int[] nums) {
            int step = 0;
            int max = 0;
            int start = 0;
            for (int i = 0; i < nums.length - 1; i++) {
                max = Math.max(max, i + nums[i]);
                if (i == start) {
                    step++;
                    start = max;
                }
            }
            return step;
        }
    

      

    巧用 Integer.MAX_VALUE;来替换 true

    public int jump(int[] A) {
            // write your code here
            //state
            int[] can = new int[A.length];
           
            //initialize
            can[0] = 0;
            
            //function
            for (int i = 1; i < A.length; i++) {
                can[i] = Integer.MAX_VALUE;
                for (int j = 0; j < i; j++) {
                    if (can[j] != Integer.MAX_VALUE && j + A[j] >= i) {
                        can[i] = can[j] + 1 > can[i] ? can[i] : can[j] + 1;
                    }
                    }
            }
            return can[A.length - 1];
        }
    

      

  • 相关阅读:
    INSERT
    jQuery选择器
    工厂模式
    快乐的Linux命令行
    Linux常用命令与基本概念
    RAC 集群更换IP
    RMAN-03009 ORA-19504 ORA-27038
    Redhat 6.4_联网 yum 配置
    /dev/sda3: UNEXPECTED INCONSISTENCY; RUN fsck MANUALLY
    nginx安装笔记
  • 原文地址:https://www.cnblogs.com/apanda009/p/7290941.html
Copyright © 2011-2022 走看看