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.)
复杂度：O(n)
int jump(int A[], int n) {
if(n <= 1) return 0;
int start = 0, end = 0, count = 0;
while (1)
{
count ++;
int _max = end; //_max表示[start, end]区间能达到的最远的位置
for(int i = start, i <= end; ++i){
_max = max(_max, i + A[i]);
if(_max >= n - 1){
return count;
}
}
start = end;
end = _max;
}
}原文：http://blog.csdn.net/zhengsenlie/article/details/39166719