无意间看到,力扣存算法代码居然还得升级vip。。。好吧,我自己存吧
golang:
func canJump(nums []int) bool {
maxNum := 0
n := len(nums)
for i, _ := range nums {
if i > maxNum {
return false
}
maxNum = max(maxNum, i+nums[i])
if maxNum >= n-1 {
return true
}
}
return false
}
python:
class Solution(object):
def canJump(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
max_reach = 0
n = len(nums)
for i in range(n):
if i > max_reach:
return False
max_reach = max(max_reach, i + nums[i])
if max_reach >= n - 1:
return True
return False
javascript:
/**
* @param {number[]} nums
* @return {boolean}
*/
var canJump = function(nums) {
let n = nums.length;
let maxNum = 0
for(let i=0; i<n; i++){
if (i > maxNum){
return false
}
maxNum = Math.max(maxNum, i+nums[i])
if (maxNum >= n-1) {
return true
}
}
};