Jump Game II

Medium

Given an array nums where nums[i] is the maximum jump length from index i, return the minimum number of jumps to reach the last index. You can assume the last index is always reachable.

Example 1

Input:  nums = [2,3,1,1,4]
Output: 2
Explanation: Jump 1 step to index 1, then 3 steps to the end.

Example 2

Input:  nums = [2,3,0,1,4]
Output: 2

Constraints

• 1 <= nums.length <= 10^4
• 0 <= nums[i] <= 1000
• The last index is reachable.