LintCode_362 Sliding Window Maximum

Given an array of n integer with duplicate number, and a moving window(size k), move the window at each iteration from the start of the array, find the maximum number inside the window at each moving.

Have you met this question in a real interview? 

Yes

Example

For array [1, 2, 7, 7, 8], moving window size k = 3. return[7, 7, 8]

At first the window is at the start of the array like this

[|1, 2, 7| ,7, 8] , return the maximum 7;

then the window move one step forward.

[1, |2, 7 ,7|, 8], return the maximum 7;

then the window move one step forward again.

[1, 2, |7, 7, 8|], return the maximum 8;

Challenge 

o(n) time and O(k) memory

思路是这样的：

遍历数组nums，使用双端队列deque维护滑动窗口内有可能成为最大值元素的数组下标

由于数组中的每一个元素至多只会入队、出队一次，因此均摊时间复杂度为O(n)

记当前下标为i，则滑动窗口的有效下标范围为[i - (k - 1), i]

若deque中的元素下标＜ i - (k - 1)，则将其从队头弹出，deque中的元素按照下标递增顺序从队尾入队。

这样就确保deque中的数组下标范围为[i - (k - 1), i]，满足滑动窗口的要求。

当下标i从队尾入队时，顺次弹出队列尾部不大于nums[i]的数组下标（这些被弹出的元素由于新元素的加入而变得没有意义）

deque的队头元素即为当前滑动窗口的最大值

class Solution {
public:
    /**
     * @param nums: A list of integers.
     * @return: The maximum number inside the window at each moving.
     */
    vector<int> maxSlidingWindow(vector<int> &nums, int k) {
        // write your code here
        vector<int> index;
        vector<int> res;
        for (int i = 0; i < nums.size(); i++) {
            if (i == 0) {
                index.push_back(0);
            } else {
               int last_index = index.back();
               while (nums[i] > nums[last_index]) {
                      int l = index.size() - 1;
                      index.erase(index.begin() + l);
                      if (index.size() == 0) {
                          break;
                      }
                      last_index = index.back();
                }
                index.push_back(i);
                while (index[0] < i - k + 1) {
                    index.erase(index.begin());
                }
            }
            if (i >= (k - 1)) {
                res.push_back(nums[index[0]]);
            }
        }
        
        return res; 

    }
};