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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
              if (n==1){
	     	return 0;
	   }
	int i=0;
	int jumps=0;
	int cur_max=0;
	while(i<n){
		cur_max=i+A[i];
		if (cur_max>0){jumps++;}
		
		if (cur_max>=n-1){return jumps;}
		int tempmax=0;
		for (int j=i+1;j<=cur_max;j++)
		{
			
			  if (j+A[j]>tempmax)
			  { 
			    	tempmax=j+A[j];
			    	i=j;
			   }
		}
	}
	return jumps;
    }
};