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?

这道题让我们找滑动窗口内最大值，直接暴力循环比较复杂度肯定高，我想到的优化方式就是用堆这个数据结构。每一次窗口需要右滑，那就有元素出去有元素新加入，我一开始想到的是每次都建个大顶堆，每次建堆得复杂度都可以认为是O（nlogn）（近似值，具体值其实为O(n)),那么复杂度也高，网上翻阅别人写的方案，也是用堆，具体是优先级队列，逐个将元素与位置作为pair插入优先级队列并取出最大值，当最大值的位置在滑窗以外，那么我们就将这个最大值丢掉，重新取最大值，直到取到在滑窗内的最大值。很是巧妙！

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