# leetle

## 9. Sliding Window Maximum

Write a function `solve` that returns the maximum number in each window of size k sliding from left to right in a list. Your function should return a list of ints.

**Example:** `Input: [1,3,-1,-3,5,3,6,7], k=3` `Output: [3,3,5,5,6,7]`

Make sure you `return` your solution, don't print!

```python

def solve(nums, k):
    pass
```