45. Jump Game II Hard

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

Note:

You can assume that you can always reach the last index.

思路: 首先题目提醒我们一定能够到达终点，这样在解答的时候不必考虑复杂的特殊情况。本题需要我们找出最少的跳动次数，就一般性而言，我们每次跳动都选择跳到下一次能够跳到最远的点，也就是说我们在一次能够跳到的点上，观察从哪一个点可以调到最远，我们就选择跳到这个点上。一旦可以到达终点就停止跳动计数，得到结果。

class Solution {
public:
    int jump(vector<int>& nums) {
        if (nums.size() <= 1) {
            return 0;
        }
        int count = 0;
        int result = 0;
        int temp = 0;
        for (int i = 0; i < nums.size(); ) {
            result++;
            count = 0;
            if (i + nums[i] >= nums.size() - 1) {
                break;
            }
            for (int j = i + 1; j <= i + nums[i] && j < nums.size(); j++) {
                int temp2 = count;
                count = max(count, j + nums[j]);
                if (count > temp2) {
                    temp = j;
                }
            }
            if (temp >= nums.size() - 1) {
                break;
            }
            i = temp;
        }
        return result;
    }
};