生成窗口最大值数组

有一个整型数组arr和一个大小为w的窗口从数组的最左边滑到最右边，窗口每次向右边滑一个位置，求每一种窗口状态下的最大值。（如果数组长度为n，窗口大小为w，则一共产生n-w+1个窗口的最大值）

代码如下：

import java.util.LinkedList;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static int[] maxInWindow(int[] num, int window) {
        if (num == null && window > num.length && window < 1){
            return null;
        }
        LinkedList<Integer> qmax = new LinkedList<>();
        int index = 0;
        int[] res = new int[num.length - window + 1];
        for (int i = 0; i < num.length; i++) {
            while (!qmax.isEmpty() && num[qmax.peekLast()] < num[i]) {
                qmax.pollLast();
            }
            qmax.addLast(i);
            if (qmax.peekFirst() == i - window) {
                qmax.pollFirst();
            }
            if (i >= window - 1) {
                res[index++] = num[qmax.peekFirst()];
            }
        }
        return res;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        String s = "";
        while ((s = bf.readLine()) != null) {
            String[] parameter = s.split(" ");
            int numLen = Integer.parseInt(parameter[0]);
            int winLen = Integer.parseInt(parameter[1]);
            int[] num = new int[numLen];
            String[] elements = bf.readLine().split(" ");
            for (int i = 0; i < numLen; i++) {
                num[i] = Integer.parseInt(elements[i]);
            }
            int[] res = maxInWindow(num, winLen);
            for (int i : res) {
                System.out.print(i + " ");
            }
            System.out.println();
        }
    }
}