You are given a 0-indexed array `nums` where `nums[i]` is the maximum jump length from index `i`. You start at index 0 and want to reach the last index. The test data guarantees you can.
Return the **minimum number of jumps** to reach the last index.
Example 1
Input:nums = [2,3,1,1,4]
Output:2
Explanation:Jump 1 step to index 1, then 3 steps to the end.
Constraints
- 1 <= nums.length <= 10^4
- 0 <= nums[i] <= 1000
- It is always possible to reach nums[n-1]