← 返回 bytedance 的题目列表Jump Game
类型：online_judge
Given an array of non-negative integers 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.
Input:
A non-negative integer array nums with length n in the range [1, 10^4]. Each element in the array is in the range [0, 10^5].
Output:
Return true if you can reach the last index, otherwise return false.
Example:
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. Its maximum jump length is 0, so you cannot reach the last index.
Example
Input
2,3,1,1,4