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

思路：用Max表示[0, i-1]能到达的最远距离，cur表示用ans步到达的距离。那么如果cur<i的话，代表它需要再走一步，所以它就可以到达前i-1能到达的最远距离，可以这么想Max一定是某个位置起跳的，而cur也一定是大于等于Max的起始位置的，因为每个位置的是都是非负数，所以cur一定是>=Max的起始位置的，可以动手写写。

class Solution {
public:
    int jump(int A[], int n) {
        int ans = 0, Max = 0, cur = 0;
        for (int i = 0; i < n; i++) {
            if (cur >= n-1) break;
            if (cur < i) {
                ans++;
                cur = Max;
            }
            Max = max(Max, A[i]+i);
        }
        return ans;
    }
};

LeetCode Jump Game II

原文：http://blog.csdn.net/u011345136/article/details/44108499