mediumGreedy
Jump Game
## Problem
You are given an integer array `nums`. You are initially positioned at the array's **first index**, and each element in the array represents your maximum jump length at that position.
Return `true` if you can reach the last index, or `false` otherwise.
You are given an integer array `nums`. You are initially positioned at the array's **first index**, and each element in the array represents your maximum jump length at that position.
Return `true` if you can reach the last index, or `false` otherwise.
Examples
Input
nums = [2,3,1,1,4]
Output
true
Jump 1 → index 1, then jump 3 → last index.
Input
nums = [3,2,1,0,4]
Output
false
Always stuck at index 3 (val 0).
Constraints
1 <= nums.length <= 10^4
0 <= nums[i] <= 10^5
Python
Loading...