You are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.
Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at index i, you can jump to any index i + j where:
0 <= j <= nums[i] andi + j < nReturn the minimum number of jumps to reach index n - 1. The test cases are generated such that you can reach index n - 1.
1 <= nums.length <= 10^40 <= nums[i] <= 1000nums[n - 1]nums = [2,3,1,1,4]2nums = [2,3,0,1,4]2