题解 | 滑动窗口的最大值

import java.util.*;


public class Solution {
	// 时间复杂度O(nm);
    public ArrayList<Integer> list = new ArrayList<>();
    public ArrayList<Integer> maxInWindows (int[] num, int size) {
        // write code here
        if(size > num.length || num.length == 0 || size == 0) return list;
        int i = 0;
        int j = i + size - 1;
        for(;j < num.length; i++, j++){
            int[] subNums = Arrays.copyOfRange(num, i, j + 1);
            int max = calMax(subNums);
            list.add(max);
        }
        return list;
    }

    // 计算数组中的最大值
    public int calMax(int[] subNums){
        int max = 0;
        for(int i : subNums){
            if(i > max){
                max = i;
            }
        }
        return max;
    }
}