Jump game
Mediumgreedyarray
You start at the first index. nums[i] is the maximum jump length from index i. Return true if you can reach the last index.
Example 1
Input: nums = [2,3,1,1,4] Output: true
Example 2
Input: nums = [3,2,1,0,4] Output: false
Every path gets stuck at index 3, whose value is 0.
Constraints
- 1 ≤ nums.length ≤ 10⁴
- 0 ≤ nums[i] ≤ 10⁵
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {int[]} nums
* @return {bool}
*/
function canJump(nums) {
}