• ㊗️
• 大家
• offer
• 多多！

Problem

Given an array of non-negative integers nums, 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.

You can assume that you can always reach the last index.

Example 1:

Input: nums = [2,3,1,1,4]
Output: 2
Explanation: 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.


Example 2:

Input: nums = [2,3,0,1,4]
Output: 2


Constraints:

• $1 <= nums.length <= 10^4$
• 0 <= nums[i] <= 1000

Code

class Solution {
public int jump(int[] nums) {
int jumps = 0;

int currEnd = 0;
int currFarthest = 0;

// [2,3,1,1,4]
for (int i = 0; i < nums.length - 1; i++) {
currFarthest = Math.max(currFarthest, i + nums[i]);

if (i == currEnd) {
jumps++;
currEnd = currFarthest;
}
}

return jumps;
}
}

class Solution {
public int jump(int[] nums) {
int len = nums.length;
int[] dp = new int[len];

for(int i = 0; i < len; i++) {
dp[i] = i;
}

for(int i = 0; i < len; i++) {
for(int j = 1; j <= nums[i]; j++) {
if(i + j >= len) break;
dp[i + j] = Math.min(dp[i + j], dp[i] + 1);
}
}

return dp[len - 1];
}
}