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\. Medium 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 <= 104 * `0 <= nums[i] <= 1000`

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)