[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) {
int jump=0;
int i=0;
while(i<n-1)
{
int maxstep=i+A[i];
jump++;
if(maxstep>=n-1) return jump;
else
{
int temp=0;
for(int j=i+1;j<=maxstep&&j<n-1;j++)
{
if(temp<j+A[j])
{
temp=j+A[j];
i=j;
}
}
}
}
return jump;
}
};