leetcode 239 滑动窗口最大值
class Solution {
public int[] maxSlidingWindow(int[] nums, int k) {
int len = nums.length;
int[] res = new int[len-k+1];
Deque<Integer> deque = new LinkedList<>();
for(int i=0;i<len;i++){
while(deque.size()>0&&nums[deque.peekLast()]<nums[i]){
deque.pollLast();
}
deque.addLast(i);
if(i>=k-1){
while(deque.peek()<(i-k+1)){
deque.poll();
}
res[i-k+1] = nums[deque.peek()];
}
}
return res;
}
}