You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. Return the minimum number of jumps to reach nums[n - 1]. The test cases are generated such that you can always reach nums[n - 1].

Example 1:

Input:  2 3 1 1 4
Output: 2

(Jump from index 0 to 1, then to 4)

Example 2:

Input:  2 3 0 1 4
Output: 2

Constraints:

• 1 ≤ nums.length ≤ 10⁴
• 0 ≤ nums[i] ≤ 1000
• It's guaranteed you can reach the last index

Input format: Space-separated integers.

Output format: Minimum number of jumps.