栈，队列

剑指offer59-Ⅰ 滑动窗口的最大值

class Solution:
    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
        # deque保存当前最大值，和下一个可能的最大值。未形成窗口和形成窗口分别放在两个循环,时间复杂度o(n))，空间复杂度o(1)
        if not nums:
            return []
        deque=collections.deque()
        n,res=len(nums),[]
        for i in range(k):
            while deque and nums[i] > deque[-1]:
                deque.pop()
            deque.append(nums[i])
        res.append(deque[0])
        for i in range(k,n):
            if nums[i-k] == deque[0]:
                deque.popleft()
            while deque and nums[i] > deque[-1]:
                deque.pop()
            deque.append(nums[i])
            res.append(deque[0])
        return res

剑指offer59-Ⅱ 队列的最大值

import queue
class MaxQueue:

    def __init__(self):
        self.deque=queue.deque()
        self.queue=queue.Queue()
    # 定义deque

    def max_value(self) -> int:
        if not self.deque:
            return -1
        else:
            return self.deque[0]


    def push_back(self, value: int) -> None:
        while self.deque and value > self.deque[-1]:
            self.deque.pop()
        self.deque.append(value)
        self.queue.put(value)
        
            

    def pop_front(self) -> int:
        if not self.deque:
            return -1
        ans = self.queue.get()
        if ans == self.deque[0]:
            self.deque.popleft()
        return ans



# Your MaxQueue object will be instantiated and called as such:
# obj = MaxQueue()
# param_1 = obj.max_value()
# obj.push_back(value)
# param_3 = obj.pop_front()