45、Jump Game II

最新推荐文章于 2025-12-06 07:43:37 发布

原创最新推荐文章于 2025-12-06 07:43:37 发布 · 447 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一种解决最小跳跃步数问题的算法，通过数组元素表示当前位置的最大跳跃距离，目标是达到数组末尾，算法在每一步选择能跳到的最大位置进行优化。

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

Array Greedy

int jump(int A[], int n) {
       //求最小跳跃步数，美团笔试题，一定要一个数组用来记录步数吗？此题很巧妙，每个循环我都是能跳到的最大位置，
       int i = 0, maxP = 0, maxNp;
       int count = 0;
       while (i < n && maxP < n - 1)
       {
           int j = i;
           maxNp = maxP;
           ++count;
           while (j <= maxP)
           {
               if (A[j] + j > maxNp)
                   maxNp = A[j] + j;
               ++j;
           }
           i = j;
           maxP = maxNp;
       }
       return count;
    }