LeetCode Top 100 Liked Questions 239. Sliding Window Maximum (Java版; Hard)
题目描述
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
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?
classSolution{publicint[]maxSlidingWindow(int[] nums,int k){int n = nums.length;int[] res =newint[n-k+1];int p =0;
LinkedList<Integer> queue =newLinkedList<>();for(int i=0; i<n; i++){while(!queue.isEmpty()&& nums[i]> nums[queue.peekLast()]){
queue.pollLast();}
queue.add(i);if(i-queue.peek()>=k){
queue.poll();}if(i+1>=k){
res[p++]= nums[queue.peek()];}}return res;}}