和为s的连续队列
一个很有趣的个人博客,不信你来撩 fangzengye.com

import queue
class MaxQueue:
def __init__(self):
self.deque = queue.deque()
def max_value(self) -> int:
return max(self.deque) if self.deque else -1
def push_back(self, value: int) -> None:
self.deque.append(value)
def pop_front(self) -> int:
return self.deque.popleft() if self.deque else -1
# 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()
我的个人博客fangzengye.com, 欢迎来撩哦!
原文博主: 热衷开源的宝藏Boy
版权声明: 自由转载-非商用-禁止演绎-保持署名| CC BY-NC-ND 3.0
浙公网安备 33010602011771号