题目描述
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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]}。
思路:
参考:https://blog.csdn.net/u010429424/article/details/73692248
代码:
import java.util.ArrayList;
import java.util.LinkedList;
public class Solution {
public static ArrayList<Integer> maxInWindows(int [] num, int size)
{
ArrayList<Integer> res = new ArrayList<Integer>();
if(num == null || num.length == 0 || num.length < size || size == 0)
return res;
LinkedList<Integer> q = new LinkedList<Integer>();
for(int i = 0;i < num.length ;i++){
if(!q.isEmpty()) {
if(i >= q.peek() + size)
q.poll();
while(!q.isEmpty() && num[i] > num[q.getLast()])
q.removeLast();
}
q.offer(i);
if(i + 1 >= size)
res.add(num[q.peek()]);
}
return res;
}
}