LeetCode 45 跳跃游戏II

用迭代没做出来，还是继续用贪心法。

class Solution {
public:
    
    int jump(vector<int>& nums) {
        int count=0;
        int n=nums.size();
        if(n==0||n==1) return 0;
        int rightmost=0;
        int end=0;
        for(int i=0;i<n-1;++i){
            if(rightmost>=i){
                rightmost=max(rightmost,i+nums[i]);
                if(i==end){
                    end=rightmost;
                    ++count;
                }
            }
        }
        return count;
    }
};`

之后再试试动态规划法来做

标签：count,end,nums,int,45,II,rightmost,return,LeetCode
来源： https://blog.csdn.net/dmsobtl/article/details/114207849