[LeetCode][JavaScript]Jump Game

时间:2015-05-17 12:14:21   收藏:0   阅读:109

https://leetcode.com/problems/jump-game/

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.

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

 


 

 

水水的贪心

 

/**
 * @param {number[]} nums
 * @return {boolean}
 */
var canJump = function(nums) {
    var hasJump = nums[0];
    for(var i = 1; i < nums.length; i++){
        if(hasJump <= 0){
            return false;
        }else{
            hasJump--;
            hasJump = Math.max(hasJump, nums[i]);
        }
       
    }
    return true;
};

 

评论(0
© 2014 mamicode.com 版权所有 京ICP备13008772号-2  联系我们:gaon5@hotmail.com
迷上了代码!