贪心算法——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.
解题思路：采用贪心方法遍历数组，并计算每个位置的最好的结果。直到最后一个位置，比较结果并返回true或false。

import java.math.*;public class Solution {    public boolean canJump(int[] A) {      int maxReach = 0;        int n=A.length;      for(int i=0;i<n && i<=maxReach;i++){          if(maxReach<(i+A[i])){              maxReach=i+A[i];          }      }      if(maxReach<n-1)         return false;      return true;    }}