标签：
https://leetcode.com/problems/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; };
[LeetCode][JavaScript]Jump Game
标签：
原文地址：http://www.cnblogs.com/Liok3187/p/4509342.html
