252. Jump Game II — Minimum Jumps

Medium · Greedy

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 always reach the last index.

Examples

Example 1
Input: nums = [2,3,1,1,4]
Output: 2
Explanation: Jump 1 step from index 0 to 1, then 3 steps to last

Constraints

• 1 ≤ n ≤ 10⁴, 0 ≤ nums[i] ≤ 1000