[leetcode-in-go] 0055-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.

解题思路

• 第一思路往往是回溯法，发现 Timeout
• 参考大佬的思路，只要跳跃能够接续，而且最大能跳到的位置大于等于数组尾，即可返回 True

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func canJump(nums []int) bool {
	rightMax := 0
	for i, v := range nums {
		if rightMax < i {  // 保证从以前的位置可以跳到当前位置
			break
		}
		rightMax = max(rightMax, i+v) // 更新截止到当前位置能向右跳的最远位置
	}
	return rightMax >= len(nums)-1 // 最远位置大于等于末尾位置，即为可达
}