【LeetCode】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.

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
Note: 
You may assume k is always valid, 1 ≤ k ≤ input array's size for non-empty array.

Follow up:
Could you solve it in linear time?

思路：滑动窗口经典题，通过单调队列来维护最大值即可，维护一个单调减队列，这样队头就是最大值否则递增的话队头对后面完全没有作用，跟所有单调队列思路一样，先pop尾部直到队列为递减队列，然后pop头部直到窗口大小为k，代码：

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

    }
};