55. 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.

本题考查的是贪心选择，贪心选择性质是选择从当前看来最好的选择，代码如下：

 1 public class Solution {
 2     public boolean canJump(int[] nums) {
 3         if(nums.length==1) return true;
 4         int max = nums[0];
 5         for(int i=0;i<nums.length;i++){
 6             max = Math.max(nums[i],max);
 7             if(max<=0&&i<nums.length-1) return false;
 8             max--;
 9         }
10         return true;
11     }
12 }

55. Jump Game

原文：http://www.cnblogs.com/codeskiller/p/6401201.html