LeetCode:Jump Game II

Jump Game II

Total Accepted: 65982  Total Submissions: 259300  Difficulty: Hard

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

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

Subscribe to see which companies asked this question

Hide Tags

  Array Greedy

java code:

public class Solution {
    public int jump(int[] nums) {
        
        int currJumpMax = 0; // 当前可跳的最远距离
        int lastJumpMax = 0; // 上一次可跳的最远距离
        int stepCount = 0; // 步数
        
        for(int i=0;i<nums.length-1;i++) {
            currJumpMax = Math.max(currJumpMax, i + nums[i]);
            if(i==lastJumpMax) { //到了上一次可跳的距离才可更新步数
                stepCount++;
                lastJumpMax = currJumpMax;
            }
        }
        return stepCount;
    }
}