思路:遍历数组,窗口右移,每移一次,替换下最大值,并将最大值添加到结果链表中
代码:
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> maxInWindows(int [] num, int size)
{
ArrayList<Integer> list = new ArrayList<Integer>();
if((num.length == 0) || (size == 0)){
return list;
}
int temp = 0;
for(int i = 0;i <= num.length - size;i ++){
temp = 0;
for(int j = 0;j < size;j ++){
if(num[i + j] > temp){
temp = num[i + j];
}
}
list.add(temp);
}
return list;
}
}
end