【leetcode】Jump Game II

最新推荐文章于 2024-09-24 08:39:28 发布

jimmybao0730

最新推荐文章于 2024-09-24 08:39:28 发布

阅读量355

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/linglun3/article/details/45999287

版权

leetcode 专栏收录该内容

101 篇文章 0 订阅

订阅专栏

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.)
思路:
其实就是记录下走到当前位置的时候的最小步数，用cur记录当前位置可达的最大位置，last记录之前可以到达的最大位置。

class Solution {
public:
    int jump(vector<int>& nums) {
        int n=nums.size();
        if(n==0||n==1) return 0;
        if(nums[0]==0) return 0;
        int res=0;
        int cur=0,last=0;
        for(int i=0;i<n;i++)
        {
            if(last<i)
            {
                last=cur;
                res++;
            }
            cur=max(cur,i+nums[i]);
        }
        return res;
    }
};