## Question

You are given an array of integers `nums`

, there is a sliding window of size `k`

which is moving from the very left of the array to the very right. You can only see the `k`

numbers in the window. 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]Explanation:Window position Max --------------- ----- [1 3 -1] -3 5 3 6 731 [3 -1 -3] 5 3 6 731 3 [-1 -3 5] 3 6 751 3 -1 [-3 5 3] 6 751 3 -1 -3 [5 3 6] 761 3 -1 -3 5 [3 6 7]7

**Example 2:**

Input:nums = [1], k = 1Output:[1]

**Constraints:**

`1 <= nums.length <= 10`

^{5}`-10`

^{4}<= nums[i] <= 10^{4}`1 <= k <= nums.length`

## Python Solution

class Solution: def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]: out = [] out.append(max(nums[:k])) for i in range(len(nums)-k): new = nums[i+k] old = nums[i] if new>out[-1]: out.append(new) else: if out[-1]==old: out.append(max(nums[i+1:k+i+1])) else: out.append(out[-1]) return(out)