leetcode day27滑动窗口的最大值

1.题目描述

2.代码构思（debug)

class Solution:
    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
        # if not nums:
        #     return

        # len1 = len(nums)

        # # 注意 Python 默认的优先队列是小根堆
        # q = [(-nums[i], i) for i in range(k)]
        # heapq.heapify(q)

        # ans = [-q[0][0]]
        # for i in range(k, len1):
        #     heapq.heappush(q, (-nums[i], i))
        #     while q[0][1] <= i - k:
        #         heapq.heappop(q)
        #     ans.append(-q[0][0])
        
        # return ans

        len1 = len(nums)
        q = collections.deque()
        for i in range(k):
            while q and nums[i] >= nums[q[-1]]:
                q.pop()
            q.append(i)

        ans = [nums[q[0]]]
        for i in range(k, len1):
            while q and nums[i] >= nums[q[-1]]:
                q.pop()
            q.append(i)
            while q[0] <= i - k:
                q.popleft()
            ans.append(nums[q[0]])
        
        return ans