Sliding Window Maximum

class Solution {
    public int[] maxSlidingWindow(int[] nums, int k) {
        int max = 0;
        int[] res = new int[nums.length-k+1];
        for(int i = 0; i<=nums.length-k; i++){
            max = Integer.MIN_VALUE;
            for(int j = i; j<i+k; j++){
                max = Math.max(nums[j], max);
            }
            res[i] = max;
        }
        return res;
    }
}