239. Sliding Window Maximum（图解）

Super_Whw

于 2020-08-04 22:17:00 发布

阅读量155

点赞数

分类专栏： Leetcode Favorate [图解]

本文链接：https://blog.csdn.net/weixin_42939835/article/details/107602278

版权

Leetcode Favorate [图解] 专栏收录该内容

68 篇文章 1 订阅

订阅专栏

这篇博客介绍了如何解决滑动窗口最大值的问题，给出了具体的C++实现，并解释了使用双向队列的思路。讨论了线性时间复杂度的解决方案。

摘要由CSDN通过智能技术生成

239. Sliding Window Maximum

Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window.

Follow up:
Could you solve it in linear time?

Example:

Input: nums = [1,3,-1,-3,5,3,6,7], and k = 3
Output: [3,3,5,5,6,7] 
Explanation: 

Window position                Max
---------------               -----
[1  3  -1] -3  5  3  6  7       3
 1 [3  -1  -3] 5  3  6  7       3
 1  3 [-1  -3  5] 3  6  7       5
 1  3  -1 [-3  5  3] 6  7       5
 1  3  -1  -3 [5  3  6] 7       6
 1  3  -1  -3  5 [3  6  7]      7

Constraints:

1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4
1 <= k <= nums.length

Solution

C++

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