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

思路：

本能的想法仍然是动规，但是还是会超时。考虑在Jump Game的基础上进行更改，reach记录当前可到的最远距离，nextreach表示如果再走一步可到的最远距离，然后进行一次遍历，当reach不能满足要求时step加一，更新reach为nextreach。

代码：

    int max(int a, int b){
        if(a > b)
            return a;
        return b;
    }
    int jump(int A[], int n) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(n <= 1)
            return 0;
        int reach=A[0], nextreach=A[0];
        int i;
        int step=1;
        for(i = 1; i < n; i++){
            if(i > reach){
                reach = nextreach;
                step++;
            }
            nextreach = max(nextreach, i+A[i]);
        }
        return step;
    }