Description

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
Explanation:

Jump 1 step from index 0 to 1, then 3 steps to the last index.

Input:nums = [3,2,1,0,4]
Output:false
Explanation:

You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.

Input:nums = [0]
Output:true
Explanation:

With nums = [0], it is possible to reach the last index by making valid jumps from the starting position.

Constraints

  • 1 ≤ nums.length ≤ 10⁴
  • 0 ≤ nums[i] ≤ 10⁵

Ready to solve this problem?

Practice solo or challenge other developers in a real-time coding battle!