Package g0001_0100.s0045_jump_game_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • <code>1 <= nums.length <= 10<sup>4</sup></code>

    • 0 &lt;= nums[i] &lt;= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer jump(IntArray nums)

      • Methods inherited from class java.lang.Object

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