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 = , and k = 3
Output: 
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[1,3,-1,-3,5,3,6,7][3,3,5,5,6,7] 
Explanation: 

滑動窗口中的最大值，使用雙端隊列保存下標，窗口內左邊比右邊第一個小的不用考慮。

class Solution {
    private Deque<Integer> deque = new ArrayDeque<>();
    public int[] maxSlidingWindow(int[] nums, int k) {
        if (nums == null || nums.length <= 0)
            return new int[0];
        int[] res = new int[nums.length - k + 1];
        for (int i=0; i<nums.length; i++) {
            if (!deque.isEmpty() && deque.peekFirst() == i-k)
                deque.pollFirst();
            while (!deque.isEmpty() && nums[deque.peekLast()] < nums[i])
                deque.pollLast();
            deque.offerLast(i);
            if (i >= k - 1)
                res[i-k+1] = nums[deque.peekFirst()];
        }
        return res;
    }
}

 

 

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 = , and k = 3
Output: 
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[1,3,-1,-3,5,3,6,7][3,3,5,5,6,7] 
Explanation: