题目描述
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{2,3,4,2,6,2,5,1}及滑动窗口的大小3,那么一共存在6个滑动窗口,他们的最大值分别为{4,4,6,6,6,5}; 针对数组{2,3,4,2,6,2,5,1}的滑动窗口有以下6个: {[2,3,4],2,6,2,5,1}, {2,[3,4,2],6,2,5,1}, {2,3,[4,2,6],2,5,1}, {2,3,4,[2,6,2],5,1}, {2,3,4,2,[6,2,5],1}, {2,3,4,2,6,[2,5,1]}。
窗口大于数组长度的时候,返回空
//思路:使用单调队列,参考lc
import java.util.Deque;
import java.util.ArrayList;
import java.util.LinkedList;
public class Solution {
public ArrayList<Integer> maxInWindows(int [] num, int size)
{
ArrayList<Integer> list = new ArrayList<>();
if(num.length == 0 || size < 1 || size > num.length){
return list;
}
Deque<Integer> deque = new LinkedList<>();
for(int i = 0; i < size; i++){
if(!deque.isEmpty() && deque.peekLast() < num[i]){
deque.removeLast();
}
deque.addLast(num[i]);
}
list.add(deque.peekFirst());
for(int i = size; i < num.length; i++){
if(deque.peekFirst() == num[i - size]){
deque.removeFirst();
}
while(!deque.isEmpty() && deque.peekLast() < num[i]){
deque.removeLast();
}
deque.add(num[i]);
list.add(deque.peekFirst());
}
return list;
}
}