Sliding Window Maximum
You are given an array of integers nums, and there is a sliding window of size k moving from the very left of the array to the very right. You can only see the k numbers inside the window at any time. Each time, the sliding window moves right by one position.
Return the max sliding window.
Example 1
Input
nums = [1,3,-1,-3,5,3,6,7], k = 3Output
[3,3,5,5,6,7]The maximum values for each window of size 3 are 3, 3, 5, 5, 6, and 7.
Example 2
Input
nums = [1], k = 1Output
[1]The only window contains the single value 1, so its maximum is 1.
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
- 1 <= k <= nums.length