leetcode------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[] A) {
3         int maxStep=0;
4         for(int i=0;i<=maxStep&&maxStep<A.length-1;i++){
5             if(i+A[i]>maxStep)maxStep=i+A[i];
6         }
7         return maxStep>=A.length-1;
8     }
9 }

leetcode------Jump Game

原文：http://www.cnblogs.com/pkuYang/p/4375832.html