Description:给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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]}。
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> maxInWindows(int [] a, int size)
{
ArrayList<Integer> list = new ArrayList<>();
int n = a.length;
if (n < size || size == 0)
return list;
int start = 0;
int max = 0;
int end = size - 1;
while (end < n) {
list.add(maxNum(a, start, end));
start++;
end++;
}
for (int aa : list) {
System.out.print(aa + " ");
}
return list;
}
public int maxNum(int[] a, int start, int end) {
int max = 0;
for (int i = start; i <= end; i++) {
if (max < a[i])
max = a[i];
}
return max;
}
}
方法二:
import java.util.ArrayList;
import java.util.LinkedList;
public class Solution {
public ArrayList<Integer> maxInWindows(int [] a, int size)
{
ArrayList<Integer> list = new ArrayList<>();
int n = a.length;
if (n < size || size == 0)
return list;
LinkedList<Integer> linkedList = new LinkedList<>();
for (int i = 0; i < n; i++) {
//存取的是下标
while (!linkedList.isEmpty() && a[linkedList.peekLast()] < a[i]) //从后往前遍历,比当前元素小的直接弹出
linkedList.pollLast();
while (!linkedList.isEmpty() && i - linkedList.peekFirst() + 1 > size) //判断元素个数是否小于size,如果大于就把队首元素弹出
linkedList.pollFirst();
linkedList.offer(i); //存下标
if (!linkedList.isEmpty() && i + 1 >= size)
list.add(a[linkedList.peekFirst()]);
}
return list;
}
}