剑指 Offer 59 - I. 滑动窗口的最大值

解法一

for循环

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        vector<int> ans;
        if(nums.size()==0) return ans;
        for (int i = 0; i <= nums.size()-k; i++)
        {
            int nummax=nums[i];
            for (int j = i; j < i+k; j++)
            {
                nummax=max(nummax,nums[j]);
            }
            ans.push_back(nummax);
        }
        return ans;
    }
};

解法二

双端队列

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        vector<int> ans;
        deque<int> deq;
        int n = nums.size();
        for (int i = 0; i < n; i++)
        {
            while (!deq.empty() && nums[i]>nums[deq.back()])
            {
                deq.pop_back();
            }
            if(!deq.empty() && deq.front()<i-k+1) deq.pop_front();
            deq.push_back(i);
            if(i>=k-1) ans.push_back(nums[deq.front()]);
        }
        return ans;
    }
};