Jump Game II
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 < n
Return the minimum number of jumps to reach index n - 1. The test cases are generated such that you can reach index n - 1.
Example 1
Input
nums = [2,3,1,1,4]Output
2Jump from index 0 to index 1, then from index 1 to the last index, for a total of 2 jumps.
Example 2
Input
nums = [2,3,0,1,4]Output
2Jump from index 0 to index 1, then from index 1 to the last index, for a total of 2 jumps.
Constraints
- 1 <= nums.length <= 10^4
- 0 <= nums[i] <= 1000
- It is guaranteed that you can reach nums[nums.length - 1]