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

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

思路：使用Greedy Algorithm，在确定下一位置的下标前，先在当前位置可能到达的范围内，挑选出该范围内能够达到最大值的下标，将该位置作为下一位置。代码实现如下：

class Solution {
public:
    int jump(vector<int>& nums) {
        if (nums.size() < 2) return 0;
        //init
        int cnt = 1, maxDis = nums[0], idx = 0, n = nums.size();

        for (int i = 0; i < n; ) {
            if (maxDis >= n-1) break;
            cnt++;
            for (int j = 1; j <= nums[i]; j++) {
                if (i+j+nums[i+j] > maxDis) {
                    idx = i+j;
                    maxDis = i + j + nums[i+j];
                }
            }
            i = idx;
        }   
        return cnt;   
    }
};