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

跳到终点最少的步数，贪心就行了，完全没必要DP。

先判断是否能直接跳到终点，否则就找后面能跳到的范围里，在下一步中可以达到最远距离的位置。

class Solution {
public:
    int jump(vector<int>& nums) {
        int st=0,result=0;
        while(st<nums.size()-1)
        {
            if(st+nums[st] >= nums.size()-1) return result+1;
            int maxx=0,pos=0;
            for(int i=1;st+i<=nums.size() && i<=nums[st];i++)
                if(i+nums[st+i]>=maxx)
                {
                    maxx=i+nums[st+i];
                    pos=i;
                }
            st+=pos;
            result++;
        }
        return result;
    }
};