leetcode 239. 滑动窗口最大值

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        priority_queue<pair<int,int>>q;
        for(int i=0;i<k;i++){
            q.emplace(nums[i],i);
        }
        vector<int>ans={q.top().first};
        for(int i=k;i<nums.size();i++){
            q.emplace(nums[i],i);
            while(q.top().second<=i-k){
                q.pop();
            }
            ans.push_back(q.top().first);
        }
        return ans;
    }
};

单调队列

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        int n = nums.size();
        deque<int> q;
        for (int i = 0; i < k; ++i) {
            while (!q.empty() && nums[i] >= nums[q.back()]) {
                q.pop_back();
            }
            q.push_back(i);
        }
 
        vector<int> ans = {nums[q.front()]};
        for (int i = k; i < n; ++i) {
            while (!q.empty() && nums[i] >= nums[q.back()]) {//每次插入数据都要遵循递减
                q.pop_back();
            }
            q.push_back(i);
            while (q.front() <= i - k) {//还要判断一下最大值是否在窗口内//注意这里能否取等号
                q.pop_front();
            }
            ans.push_back(nums[q.front()]);
        }
        return ans;
    }
};