Jump Game#
Given a non-negative integer array nums, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
Example 1:
Input: nums = [2,3,1,1,4]
Output: true
Explanation: You can jump 1 step from index 0 to reach index 1, then 3 steps to the last index.
Example 2:
Input: nums = [3,2,1,0,4]
Output: false
Explanation: No matter how you jump, you will always end up at index 3. However, the maximum jump length at that position is 0, so you can never reach the last index.
- It can be run successfully, but cannot be submitted!!!