链接:https://leetcode-cn.com/problems/sliding-window-maximum/
维护一个双端队列,保持队列中元素单调:从左至右递减,队列中存储元素的下标,每次迭代从左边弹出超界的下标。
java代码:
class Solution {
public int[] maxSlidingWindow(int[] nums, int k) {
Deque<Integer>q = new LinkedList();
int [] res = new int [nums.length-k+1];
for(int i = 0;i<nums.length;i++)
{
while(!q.isEmpty()&&q.getFirst()<=i-k)
q.pollFirst();
while(!q.isEmpty()&&nums[q.getLast()]<nums[i])
{
q.pollLast();
}
q.addLast(i);
if(i>=k-1)
res[i-k+1] = nums[q.getFirst()];
}
return res;
}
}