LeetCode 239. Sliding Window Maximum（单调队列）

题目来源：https://leetcode.com/problems/sliding-window-maximum/

问题描述

239. Sliding Window Maximum

Hard

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?

------------------------------------------------------------

题意

给定一个数组nums和一个正整数k，以k为宽度的滑窗在nums上从左到右滑动，求滑窗里的数组局部的最大值组成的数组

------------------------------------------------------------

思路

单调队列。队列中存储nums中元素的下标。队列按下标对应的nums元素值从大到小排列。遍历nums，将元素依次入队，根据入队元素的值删除队列中小于等于该元素的数，并淘汰过期（不在窗口内）的元素。具体算法细节见代码。

时间复杂度O(n)，其中n是nums数组的长度。分析for循环内的代码，代码块2, 3, 4每次循环最多执行1次，代码块1和代码块3合起来在整个循环过程中执行O(n)次，因此复杂度为O(n).

------------------------------------------------------------

代码

class Solution {
    public int[] maxSlidingWindow(int[] nums, int k) {
        int n = nums.length;
        if (n <= 1) {
            return nums;
        }
        LinkedList<Integer> queue = new LinkedList<Integer>();
        int[] ans = new int[n-k+1];
        for (int i=0; i<n; ++i) {
            while (!queue.isEmpty() && nums[queue.getLast()] <= nums[i]) {  // 1. remove indis whose value is smaller than nums[i]
                queue.removeLast();
            }
            queue.add(i);       // 2. add next index
            if (queue.getFirst() <= i-k) {  // 3. remove invalid index
                queue.removeFirst();
            }
            if (i >= k - 1) {               // 4. get largest value
                ans[i-k+1] = nums[queue.getFirst()];
            }
        }
        return ans;
    }
}