题目原型：
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.
Your goal is to reach the last index in the minimum number of jumps.
For example:
Given array A = [2,3,1,1,4]
The minimum number of jumps to reach the last index is 2. (Jump 1 step
from index 0 to 1, then 3 steps to the last index.)
基本思路：
采用贪心算法，每次计算出能到大的最大位置即可。
public int jump(int[] A)
{
int max = 0,lastStepMax = 0,step = 0;
for(int i = 0 ;i<A.length;)
{
if(lastStepMax>=A.length-1)
break;
while(i<=lastStepMax)
{
max = max>i+A[i]?max:i+A[i];
i++;
}
lastStepMax = lastStepMax>max?lastStepMax:max;
step++;
}
return step;
}
原文：http://blog.csdn.net/cow__sky/article/details/20362573