45.Jump Game II

class Solution {
public:
    int jump2(vector<int>& nums) {
        int res = 0, n = nums.size(), last = 0, cur = 0;
        for (int i = 0; i < n - 1; ++i) {
            cur = max(cur, i + nums[i]);
            if (i == last) {
                last = cur;
                ++res;
                if (cur >= n - 1) break;
            }
        }
        return res;
    }
};

转载于:https://www.cnblogs.com/smallredness/p/10675130.html

原文链接：https://blog.csdn.net/weixin_30342827/article/details/94942586

本站声明:网站内容来源于网络,如有侵权,请联系我们,我们将及时处理。