leetcode—Jump Game II

最新推荐文章于 2019-05-13 13:40:05 发布

yiqiqiwww

最新推荐文章于 2019-05-13 13:40:05 发布

阅读量203

点赞数

分类专栏：数据结构剑指offer-java实现

本文链接：https://blog.csdn.net/yiqiqiwww/article/details/78958556

版权

数据结构同时被 2 个专栏收录

94 篇文章 0 订阅

订阅专栏

剑指offer-java实现

92 篇文章 0 订阅

订阅专栏

本文介绍了一种寻找从数组起始位置到达末尾所需的最小跳跃次数的算法。该算法使用了动态规划的思想，并通过三个关键变量curr、last及ret进行迭代更新。curr用于记录当前能到达的最远位置，last则帮助判断是否需要增加跳跃次数。

摘要由CSDN通过智能技术生成

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

class Solution {
    public int jump(int[] nums) {
        if(nums==null || nums.length<=0) return 0;
        int curr = 0;
        int last = 0;
        int ret = 0;
        for(int i=0; i<nums.length; i++){
            if(i>last){
                last = curr;
                ret++;
            }
            curr = Math.max(curr,nums[i]+i);
        }
        return ret;
    }
}