示例:
输入: nums = [1,3,-1,-3,5,3,6,7], 和 k = 3输出: [3,3,5,5,6,7] 解释: 
  滑动窗口的位置                最大值---------------               -----[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
来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

public int[] maxSlidingWindow(int[] nums, int k) {        int n = nums.length;        if (n == 0 || k == 0) {            return new int[0];        }
        Deque<Integer> deque = new LinkedList<>();        int[] ans = new int[n - k + 1];        for (int i = 0; i < k; i++) {            while (!deque.isEmpty() && deque.peekLast() < nums[i]) {                deque.removeLast();            }            deque.addLast(nums[i]);        }        ans[0] = deque.peekFirst();        for (int i = k; i < n; i++) {            if (deque.peekFirst() == nums[i - k]) {                deque.removeFirst();            }            while (!deque.isEmpty() && deque.peekLast() < nums[i]) {                deque.removeLast();            }            deque.addLast(nums[i]);            ans[i - k + 1] = deque.peekFirst();        }        return ans;    }