题目描述
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值;
例如,如果输入数组{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]};
解题思路
public class Solution {
public ArrayList<Integer> maxInWindows(int[] num, int size) {
ArrayList<Integer> ret = new ArrayList<>();
PriorityQueue<Integer> heap = new PriorityQueue<Integer>((o1, o2) -> o2 - o1); //从小到大
if (size > num.length || size < 1)
return ret;
for (int i = 0; i < size; i++)
heap.add(num[i]);
ret.add(heap.peek());
for (int i = 1, j = i + size - 1; j < num.length; i++, j++) {
heap.remove(num[i - 1]);
heap.add(num[j]);
ret.add(heap.peek());
}
return ret;
}
}