[LeetCode] Jump Game II

最新推荐文章于 2025-05-22 14:52:23 发布

原创最新推荐文章于 2025-05-22 14:52:23 发布 · 445 阅读

0 ·

CC 4.0 BY-SA版权

Algorithm 同时被 2 个专栏收录

86 篇文章

订阅专栏

LeetCode

76 篇文章

订阅专栏

本文介绍了一个算法问题：如何在给定的非负整数数组中从第一个位置到达最后一个位置所需的最少跳跃次数。通过实例说明了如何计算最少跳跃次数，并提供了一个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 is 2. (Jump 1 step from index 0 to 1, then 3 steps to the last index.)

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