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

https://leetcode-cn.com/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/

思路：双端队列deque，

//加入和删除数组，故使用双端队列，同时，deque只需要存储nums中的idx，就知道是否超出队列
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
    vector<int> res;
    deque<int> dq;
    for (int i = 0; i < nums.size(); i++) {
        while (!dq.empty() && nums[dq.back()] <= nums[i]) {
            dq.pop_back();
        }
        dq.push_back(i);
        while (i - dq.front() + 1 > k) {
            dq.pop_front();
        }
        if (i >= k - 1) {
            res.push_back(nums[dq.front()]);
        }
    }
    return res;
}

 

deque

https://blog.csdn.net/u011630575/article/details/79923132