## Description

Jump Game

Given an array of non-negative integers, 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: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
``````

Example 2:

``````Input: [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.
``````

## Solution

• 使用`reachable`表示当前可跳跃的最远位置；
• 从第一个位置开始向`reachable`搜索，并更新`reachable`
• 如果`reachable >= len(nums) - 1`表示可达最后一个数字。
 `````` 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 `````` ``````func canJump(nums []int) bool { target := len(nums) - 1 if target < 0 { return false } // 可到达的最远距离 reachable := 0 // 从 0 到 reachable for i := 0; i <= reachable; i++ { m := nums[i] + i if m > reachable { reachable = m } if reachable >= target { return true } } return reachable >= target }``````