题目链接

思路

单调队列的使用方法，将滑动窗口

代码

class Solution {
    public int[] maxSlidingWindow(int[] nums, int k) {
        int[] result = new int[nums.length - k + 1];
        Deque<Integer> deque = new ArrayDeque<>();

        int i = 0;
        int j = 0;
        for(; j < k - 1; j++){
            this.offer(deque, nums[j]);
        }

        int pos = 0;
        while(j < nums.length){
            int temp = nums[i];
            this.offer(deque, nums[j]);
            result[pos++] = deque.peekFirst();
            i++;
            j++;
            this.poll(deque, temp);
        }

        return result;
    }

    private void offer(Deque<Integer> deque, int value){
        while(!deque.isEmpty() && deque.peekLast() < value){
            deque.pollLast();
        }
        deque.offerLast(value);
    }

    private void poll(Deque<Integer> deque, int value){
        if(deque.peekFirst() == value){
            deque.pollFirst();
        }
    }
}