leetcode 跳跃游戏2

class Solution {
public:
    int jump(vector<int>& nums) {
        if(nums.size()==1)return 0;
        int curindex=0;
        int nextindex=0;
        int ans=0;
        for(int i=0;i<nums.size();i++){
            nextindex=max(i+nums[i],nextindex);//更新下一步能跳的最远距离
            if(i==curindex){
                if(curindex!=nums.size()-1){
                    ans++;
                    curindex=nextindex;
                    if(nextindex>=nums.size()-1)break;
                }else break;
                

            }
            
        }
        return ans;
    }
};