首页 > itarticle > [leetcode] problem 239 – sliding window maximum

[leetcode] problem 239 – sliding window maximum

admin 11月 13, 2020 0

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: 

1
2
3
4
5
6
7
8
 
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?

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
 
public int[] maxSlidingWindow(int[] nums, int k) {
    if (nums == null || nums.length < 1 || k < 1)
        return new int[] {};

    int[] result = new int[nums.length - k + 1];
    Deque<Integer> deque = new LinkedList<>();

    for (int i = 0; i < nums.length; i++) {
        while (!deque.isEmpty() && nums[i] > nums[deque.peekLast()])
            deque.pollLast();

        deque.offerLast(i);

        if (i >= k - 1)
            result[i - k + 1] = nums[deque.peekFirst()];

        if (i - k + 1 >= deque.peekFirst())
            deque.pollFirst();
    }

    return result;
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能