45.跳跃游戏 II

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

Accepted
106/106 cases passed (8 ms)
Your runtime beats 95.52 % of cpp submissions
Your memory usage beats 92.75 % of cpp submissions (15.8 MB)