JAVA代码—算法基础：跳跃游戏（II）

最新推荐文章于 2025-07-19 09:32:12 发布

梅森上校

最新推荐文章于 2025-07-19 09:32:12 发布

阅读量626

点赞数

CC 4.0 BY-SA版权

分类专栏：算法分析与设计文章标签：算法

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.youkuaiyun.com/seagal890/article/details/79344940

算法分析与设计专栏收录该内容

273 篇文章

订阅专栏

本文介绍了一种解决跳跃游戏II问题的算法实现。该问题要求找到从数组起始位置到达末尾所需的最少跳跃次数，每个元素代表当前位置的最大跳跃长度。通过设定当前区域范围并逐步更新边界来寻找最优解。

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

跳跃游戏（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.

For 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.)

Note:
You can assume that you can always reach the last index.

算法设计：

package com.bean.algorithmbasic;

public class JumpGameII {

    public static int jump(int[] nums) {
        // If nums.length < 2, means that we do not
        // need to move at all.
        if (nums == null || nums.length < 2) {
            return 0;
        }

        // First set up current region, which is
        // from 0 to nums[0].
        int l = 0;
        int r = nums[0];
        // Since the length of nums is greater than
        // 1, we need at least 1 step.
        int step = 1;

        // We go through all elements in the region.
        while (l <= r) {

            // If the right of current region is greater
            // than nums.length - 1, that means we are done.
            if (r >= nums.length - 1) {
                return step;
            }

            // We should know how far can we reach in current
            // region.
            int max = Integer.MIN_VALUE;
            for (; l <= r; l++) {
                max = Math.max(max, l + nums[l]);
            }

            // If we can reach far more in this round, we update
            // the boundary of current region, and also add a step.
            if (max > r) {
                l = r;
                r = max;
                step++;
            }
        }

        // We can not finish the job.
        return -1;
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int [] arrayDemo= {2,3,1,1,4};
        int result=jump(arrayDemo);
        System.out.println("ANSWER is: "+result);
    }

}

（完）