The maximum number of sliding window

滑动窗口的最大值

给定一个数组 nums 和滑动窗口的大小 k,请找出所有滑动窗口里的最大值.

示例:

输入: nums = [1,3,-1,-3,5,3,6,7], 和 k = 3
输出: [3,3,5,5,6,7]
解释:

滑动窗口的位置 最大值

---

[1 3 -1] -3 5 3 6 7 3
1 [3 -1 -3] 5 3 6 7 3
1 3 [-1 -3 5] 3 6 7 5
1 3 -1 [-3 5 3] 6 7 5
1 3 -1 -3 [5 3 6] 7 6
1 3 -1 -3 5 [3 6 7] 7

提示：

你可以假设 k 总是有效的,在输入数组不为空的情况下,1 ≤ k ≤ 输入数组的大小.

class Solution {
    

  public int[] maxSlidingWindow(int[] nums, int k) {
    

    if(nums.length==0)return nums;

    int[] a=new int[k];

    int[] end=new int[nums.length-k+1];

    int j=0;

    int cur=0;

    for(int i=0;i<nums.length;i++){
    
      a[j]=nums[i];
      j++;    
      if(j==k){
    
        Arrays.sort(a);

        end[cur]=a[k-1];

        i=cur;

        cur++;

        j=0;

      }
     if(i==nums.length+1)break;
    }
    return end;

  }

}

This problem can be solved using arrays and pointers,先声明curThis pointer points to the first value of the sliding window due to looping+is executed after the loop so subtract it from the position pointed to1to get a new array,利用Arrays种的sortmethod to find the maximum value,So you can use simpleforLoop to find the answer,stored in the final array,It can also be solved by using a queue or stack to reduce the time complexity.