LeetCode-jump-game-ii

最新推荐文章于 2020-07-12 11:11:53 发布

原创最新推荐文章于 2020-07-12 11:11:53 发布 · 322 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

LeetCode 专栏收录该内容

105 篇文章

订阅专栏

博客围绕数组跳跃问题展开，给定一个非负整数数组，数组元素代表该位置的最大跳跃长度，目标是以最少跳跃次数到达数组最后一个索引，还给出了示例数组及最少跳跃次数的结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

For example:
Given array A =[2,3,1,1,4]

The minimum number of jumps to reach the last index is2. (Jump1step from index 0 to 1, then3steps to the last index.)

public class Solution {
   public static int jump(int[] A) {
        if(A.length==0||A.length==1)
            return 0;
        int len = A.length;
        int index=0;
        int count=0;
        while (index < len-1){
            if(A[index]+index>=len-1){
                count++;
                break;
            }
            int tmp = decide(A,index);
            index+=tmp;
            count++;
        }
        return count;
    }
 
    private static int decide(int[] a,int index) {
        int max=Integer.MIN_VALUE;
        int tag=0;
        for (int i = 1; i <a[index]+1 ; i++) {
            if(i+index<a.length){
            if (max<a[index+i]+i+index){
                tag=i;
                max=a[index+i]+i+index;
            }
            }
            else break;
        }
        return tag;
    }
}