题目描述
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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;
import java.util.Collections;
public class Solution {
public ArrayList<Integer> maxInWindows(int [] num, int size)
{
ArrayList<Integer> arr = new ArrayList<Integer>();
int flagStart=0;
int max =0;
if(size == 0)
return arr;
for(int i=0;i<num.length-size+1;i++){
max = 0;
for(flagStart=i;flagStart<i+size;flagStart++){
if(num[flagStart] > max)
max = num[flagStart];
}
arr.add(max);
}
return arr;
}
public static void main(String[] args) {
int [] num = new int[]{4,3,5,4,3,3,6,7};
int size = 3;
ArrayList<Integer> arr = new Solution().maxInWindows(num, size);
System.out.println(arr);
}
}