题目描述
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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://www.nowcoder.com/practice/1624bc35a45c42c0bc17d17fa0cba788?tpId=13&tqId=11217&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
1.暴力法:
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> maxInWindows(int [] num, int size)
{
ArrayList<Integer> res = new ArrayList<>();
if(num.length==0||size==0){
return res;
}
for(int i = 0;i<=num.length-size;i++){
int max = num[i];
for(int j = i+1;j<i+size;j++){
if(num[j]>max){
max= num[j];
}
}
res.add(max);
}
return res;
}
}
2.双向队列:
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
public class Solution {
public ArrayList maxInWindows(int[] num, int size) {
ArrayList res = new ArrayList();
if (num == null || num.length == 0 || size == 0 || size > num.length) {
return res;
}
//双向队列存储的是元素的下标
LinkedList<Integer> deque = new LinkedList<Integer>();
for (int i = 0; i < num.length; i++) {
// 保证从大到小 如果前面数小则需要依次弹出,直至满足要求
while(!deque.isEmpty()&&num[deque.peekLast()]<=num[i]){
deque.pollLast();
}
// 添加当前值对应的数组下标
deque.addLast(i);
// 判断当前队列中队首的值是否有效,无效则剔除
if(deque.peekFirst()<=i-size){
deque.poll();
}
// 当窗口长度为k时 保存当前窗口中最大值(形成窗口后)
if(i+1>=size){
res.add(num[deque.peek()]);
}
}
return res;
}
}