题目:https://leetcode-cn.com/problems/sliding-window-maximum/
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
from collections import deque
d = deque()
res = []
for i in range(len(nums)):
if len(d)<k-1:
d.append(nums[i])
else:
d.append(nums[i])
res.append(max(d))
d.popleft()
return res