leetcode---jump-game-ii---贪心

最新推荐文章于 2025-08-19 17:14:13 发布

原创最新推荐文章于 2025-08-19 17:14:13 发布 · 188 阅读

0 ·

CC 4.0 BY-SA版权

题同时被 2 个专栏收录

456 篇文章

订阅专栏

贪心

36 篇文章

订阅专栏

本文介绍了一个算法问题“跳远游戏II”，旨在找到从数组起始位置到达末尾所需的最少跳跃次数。给定一个非负整数数组，每个元素代表当前位置的最大跳跃长度。文章提供了C++实现的解决方案，通过迭代更新可达范围来逐步逼近目标。

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

class Solution {
public:
    int jump(int A[], int n) 
    {
        int ans = 0;
        int cur = 0;
        int last = 0;
        for(int i=0; i<n; ++i)
        {
            if(i > last)
            {
                last = cur;
                ++ans;
            }
            cur = max(cur, i+A[i]);
        }
        return ans;
    }
};