[leetcode] Jump Game II

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

思路：从后往前查找，找到能够最先到达终点的当前节点，然后继续往前找到能够到达当前节点的最先的节点

代码：

class Solution {
public:
int jump(int A[], int n) {
if(n<=1) return 0;
int count=0;
int end=n-1;
while(end>0){
for(int i=0;i<end;i++){
if((A[i]+i)>=end){
count++;
end=i;
}
}
}
return count;
}
};