classSolution{publicint[]maxSlidingWindow(int[] nums,int k){int length = nums.length;int res[]=newint[length - k +1];if(nums == null || length ==0|| k <=0|| k > length){returnnewint[0];}int left =0, right =0, max = nums[0];int num =0;while(right < nums.length){while(right < nums.length -1&& right - left < k -1){
right++;if(nums[right]> max){
max = nums[right];}}
res[num]=(max);
num++;
left++;if(right == length -1)break;if(nums[left -1]== max){
right = left;
max = nums[left];}}return res;}}