LEETCODE 239. 滑动窗口最大值

class Solution:
    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
        q=deque()
        n=len(nums)
        res=[]
        for i in range(k):
            while q and nums[i]>=nums[q[-1]]:
                q.pop()
            q.append(i)
        res.append(nums[q[0]])
        for i in range(k,n):
            while q and nums[i]>nums[q[-1]]:
                q.pop()
            q.append(i)
            while q[0]+k<=i:
                q.popleft()
            res.append(nums[q[0]])
        return res