剑指Offer 59- 二 队列的最大值

思路：使用一个单调递减双向队列

class MaxQueue:

    def __init__(self):
        from collections import deque
        self.A, self.B = deque(), deque()

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

    def push_back(self, value: int) -> None:
        self.A.append(value)
        while self.B and self.B[-1] < value:
            self.B.pop()
        self.B.append(value)

    def pop_front(self) -> int:
        if not self.A: return -1
        res = self.A.popleft()
        if res == self.B[0]: self.B.popleft()
        return res

# 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()

 

类似题目： 求栈的最小值

class MinStack:

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.A, self.B = [], [float('inf')]


    def push(self, x: int) -> None:
        self.A.append(x)
        self.B.append(min(x, self.B[-1]))

    def pop(self) -> None:
        self.B.pop()
        self.A.pop()

    def top(self) -> int:
        return self.A[-1]

    def min(self) -> int:
        return self.B[-1]


# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(x)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.min()