[leetcode] problem 45 – jump game ii

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.

Example

Input: [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.

Note

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

Code

public int (int[] nums) {
    int result = 0;
    int current = 0;
    int prev = 0;

    for (int i = 0; i < nums.length; i++) {
        if (i > prev) {
            prev = current;
            result++;
            
            if (current >= nums.length - 1)
                break;
        }

        current = Math.max(current, i + nums[i]);
    }

    return result;
}

[leetcode] problem 45 – jump game ii

Example

Note

Code

近期文章

近期评论

标签

热门

文章归档

分类目录

功能