题目描述:给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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]}。
思路一:
用一个双端队列,队列第一个位置保存当前窗口的最大值的下标,当窗口滑动一次 :
1.判断当前最大值是否过期
2.新增加的值从队尾开始比较,把所有比他小的值丢掉
import java.util.ArrayList;
import java.util.LinkedList;
public class Solution {
public ArrayList<Integer> maxInWindows(int [] num, int size)
{
ArrayList<Integer> res = new ArrayList<>();
if (num == null || size <= 0 || num.length < size)
return res;
LinkedList<Integer> q = new LinkedList<>();
int begin;
for (int i = 0; i < num.length; i++)
{
begin = i - size + 1;
if (q.isEmpty())
q.addLast(i);
else if (begin > q.peekFirst())
q.pollFirst();
while (!q.isEmpty() && num[i] >= num[q.peekLast()])
q.pollLast();
q.addLast(i);
if (begin >= 0)
res.add(num[q.peekFirst()]);
}
return res;
}
}
思路二:
与思路一相同
import java.util.ArrayList;
import java.util.LinkedList;
public class Solution {
public ArrayList<Integer> maxInWindows(int [] num, int size)
{
ArrayList<Integer> res = new ArrayList<>();
if (num == null || size <= 0 || num.length < size)
return res;
LinkedList<Integer> indexDeque = new LinkedList<>();
for (int i = 0; i < size - 1; i++)
{
while (!indexDeque.isEmpty() && num[i] > num[indexDeque.getLast()])
indexDeque.removeLast();
indexDeque.addLast(i);
}
for (int i = size - 1; i < num.length; i++)
{
while (!indexDeque.isEmpty() && num[i] > num[indexDeque.getLast()])
indexDeque.removeLast();
indexDeque.addLast(i);
if (i - indexDeque.getFirst() + 1 > size)
{
indexDeque.removeFirst();
}
res.add(num[indexDeque.getFirst()]);
}
return res;
}
}