贪心算法（4）

最新推荐文章于 2024-11-12 10:18:43 发布

原创最新推荐文章于 2024-11-12 10:18:43 发布 · 151 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

算法专栏收录该内容

102 篇文章

订阅专栏

本文介绍了一个经典的算法问题——跳远游戏II。问题的目标是在给定的非负整数数组中，从第一个位置出发，每一步跳跃的最大长度由当前位置的数值决定，任务是以最少的跳跃次数到达数组的最后一个位置。文章提供了完整的解决方案，包括一个Java实现的例子。

原题:

/**
 * Created by gouthamvidyapradhan on 02/04/2017.
 * Given an array of non-negative integers, you are initially positioned at the first index of the array.
 * <p>
 * Each element in the array represents your maximum jump length at that position.
 * <p>
 * Your goal is to reach the last index in the minimum number of jumps.
 * <p>
 * For example:
 * Given array A = [2,3,1,1,4]
 * <p>
 * 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.)
 * <p>
 * Note:
 * You can assume that you can always reach the last index.
 */

答案：

public class JumpGameII {
    /**
     * Main method
     *
     * @param args
     * @throws Exception
     */
    public static void main(String[] args) throws Exception {

    }

    public int jump(int[] nums) {
        int step = 0;
        int e = 0, max = 0;
        for (int i = 0; i < nums.length - 1; i++) {
            max = Math.max(max, i + nums[i]);
            if (i == e) {
                step++;
                e = max;
            }
        }
        return step;
    }