贪心算法
var canJump = function(nums) {
let temp = 0;
const len = nums.length;
for(let i=0;i<len;i++){
if(i<=temp){
temp = Math.max(temp,i+nums[i]);
if(temp >= len - 1)return true;
}
}
return false;
};
贪心算法
var canJump = function(nums) {
let temp = 0;
const len = nums.length;
for(let i=0;i<len;i++){
if(i<=temp){
temp = Math.max(temp,i+nums[i]);
if(temp >= len - 1)return true;
}
}
return false;
};