LeetCode[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. 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

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

使用优先队列可以获取第K大的值，也可以实现本题目的内容，但是本题的目标是获取最大值，使用双端队列（Deque）的方式更优。

class Solution {
    public int[] maxSlidingWindow(int[] nums, int k) {
        if (null == nums || nums.length == 0 || 0 == k) {
            return new int[0];
        }
        int[] result = new int[nums.length + 1 - k];
        int maxIndex = -1;
        for (int i = 0; i < result.length; i++) {
            if (maxIndex < i) { // 获取前k个元素的最大值的下标
                maxIndex = i;
                for (int j = i + 1; j < i + k; j++) {
                    if (nums[maxIndex] <= nums[j]) {
                        maxIndex = j;
                    }
                }
            } else {
                if (nums[i + k - 1] >= nums[maxIndex])
                    maxIndex = i + k - 1;
            }
            result[i] = nums[maxIndex];

        }
        return result;
    }
}