LeetCode 239. Sliding Window Maximum. Hard。tags: 单调队列-CSDN博客

本文链接：https://blog.csdn.net/ppslizejun/article/details/124143520

该博客介绍了如何使用双端队列（deque）解决LeetCode上的滑动窗口最大值问题，提供了C++代码实现，并给出了两个示例输入和输出。代码通过不断更新队列来维护窗口内的最大值，确保窗口内元素始终为最大值。

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

题目：

You are given an array of integers 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.

Example 1:

Input: nums = [1,3,-1,-3,5,3,6,7], 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
Example 2:

Input: nums = [1], k = 1
Output: [1]

Constraints:

1 <= nums.length <= 105
-104 <= nums[i] <= 104
1 <= k <= nums.length

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/sliding-window-maximum
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

代码：

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        int n = nums.size();
        deque<int> q;
        vector<int> ans;
        for (int i = 0; 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();
            }
            if(i >= k-1){
                ans.push_back(nums[q.front()]);
            }
        }
        return ans;
    }
};