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