45. Jump Game II （贪心）

https://leetcode.com/problems/jump-game-ii/description/

题目：求最少跳跃步数

思路：贪心

class Solution {
public:
    int jump(vector<int>& nums) {
        if(nums.size()==0||nums.size()==1) return 0;
        int ret = 0,last = 0,cur = 0;
        for (int i = 0; i < nums.size(); ++i) {      
            if (i > last) {    
                last = cur;    
                ++ret;    
            }     
            cur = max(cur, i+nums[i]);    
        }    
        return ret;    
    }
};