The maximum value of the sliding window for the offer (64) of the sword

Title Description

Given an array and the size of the sliding window, find the maximum value of the values in all the sliding windows. For example, if you enter the array {2,3,4,2,6,2,5,1} and the size of the sliding window 3, there are 6 sliding windows, their maximum value is {4,4,6,6,6,5}, and the sliding window for the array {2,3,4,2,6,2,5,1} has the following 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]}.

Code:

<span style= "color: #33cc00;" >import java.util.*;p Ublic class Solution {public    arraylist<integer> maxinwindows (int [] num, int size) { c1/>arraylist<integer> list  = new arraylist<integer> ();        if (size>num.length| | size==0)            return list;        for (int i = 0;i<=num.length-size;i++) {            int max = num[i];            for (int j = i+1;j<i+size;j++) {                if (Num[j]>max) {                    max = num[j];                }            }            List.add (max);        }        return list;    }} </span>

The maximum value of the sliding window for the offer (64) of the sword