LeetCode OJ 239. Sliding Window Maximum

LeetCode OJ 239. Sliding Window Maximum

---

Description

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.

For example,
Given nums = [1,3,-1,-3,5,3,6,7], and k = 3.

Example 1

>

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, ie: 1 ≤ k ≤ input array’s size for non-empty array.

Follow up:
Could you solve it in linear time?

Hint:

1. How about using a data structure such as deque (double-ended queue)?
2. The queue size need not be the same as the window’s size.
3. Remove redundant elements and the queue should store only elements
   that need to be considered.

解题思路

最简单的方法是每次搜索窗口找出最大值，但是时间复杂度很大：n*k。另外一种比较巧妙的方法是使用deque，队列头部是当前窗口的最大值的下标，如果队列尾部的下标对应的值小于即将要入队的值，就pop掉；当队首元素等于i-k，则说明。这样可以一直维持队首是当前窗口最大元素。

代码

个人github代码链接

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        //队列的第一个值永远为当前最大值
        deque<int> q;
        vector<int> ans;
        for(int i = 0; i < nums.size(); i++){
            if(!q.empty() && q.front() == i - k)    //说明窗口要划过当前最大值
                q.pop_front();
            while(!q.empty() && nums[q.back()] < nums[i])           //队列后小于要入队的数的都出队
                q.pop_back();
            q.push_back(i);                                     //数字下标入队
            if(i >= k - 1)                                      //输入结果队列
                ans.push_back(nums[q.front()]);
        }
        return ans;
    }
};