链接:https://leetcode-cn.com/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/
给定一个数组 nums 和滑动窗口的大小 k,请找出所有滑动窗口里的最大值。
import java.util.LinkedList; class Solution { public int[] maxSlidingWindow(int[] nums, int k) { if (k == 0) { return new int[0]; } int n = nums.length; int[] ret = new int[n - k + 1]; LinkedList<Integer> queue = new LinkedList<>(); for (int i = 0; i < n; ++i) { while (!queue.isEmpty() && nums[queue.peekLast()] <= nums[i]) { queue.pollLast(); } queue.offerLast(i); if (i + 1 >= k) { ret[i + 1 - k] = nums[queue.peekFirst()]; } if (i - queue.peekFirst() + 1 == k) { queue.pollFirst(); } } return ret; } }