LeetCode Jump Game Greedy Algorithm（golang）

Problem

Analysis Process
Use the greedy algorithm idea
Select the value of the first position as the maximum length of the initial jump，then compare the jump position to the last position to determine whether the position is less than the jump position value, if so, continue
or directly determine whether max is greater than length

Code

func canJump(nums []int) bool {
n :=len(nums)            //define the length of the array
max :=nums[0]            //assume nums[0] is the maximum length for the first jump
 for i := 0; i < n; i++ {
        if nums[i] + i > max && max >= i {      //determine whether the current position plus i is greater than max
            max = nums[i] + i                // update jumps to the farthest position
        } 
        if max >= n-1{               
            return true
        }
    }
    return false
}