Package g0001_0100.s0045_jump_game_ii

Class Solution

java.lang.Object

g0001_0100.s0045_jump_game_ii.Solution

public class Solution
extends Object

45 - Jump Game II.<p>Medium</p> <p>Given an array of non-negative integers <code>nums</code>, you are initially positioned at the first index of the array.</p> <p>Each element in the array represents your maximum jump length at that position.</p> <p>Your goal is to reach the last index in the minimum number of jumps.</p> <p>You can assume that you can always reach the last index.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [2,3,1,1,4]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2,3,0,1,4]</p> <p><strong>Output:</strong> 2</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁴</code></li> <li><code>0 <= nums[i] <= 1000</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	jump(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

jump

public int jump(int[] nums)