目录
请定义一个队列并实现函数 max_value 得到队列里的最大值,要求函数max_value、push_back 和 pop_front 的均摊时间复杂度都是O(1)。
若队列为空,pop_front 和 max_value 需要返回 -1
示例 1:
输入:
[“MaxQueue”,“push_back”,“push_back”,“max_value”,“pop_front”,“max_value”]
[[],[1],[2],[],[],[]]
输出: [null,null,null,2,1,2]
示例 2:
输入:
[“MaxQueue”,“pop_front”,“max_value”]
[[],[],[]]
输出: [null,-1,-1]
限制:
1 <= push_back,pop_front,max_value的总操作数 <= 10000
1 <= value <= 10^5
思路
用数组来表示一下,queue为队列,maxValue[0]保持当前元素的最大值,下一个值如果大于maxValue[0]就替换掉,否则保存到maxValue数组后面,保持往后递减。
代码
class MaxQueue:
def __init__(self):
self.queue = []
self.maxValue = []
def max_value(self) -> int:
return self.maxValue[0] if self.maxValue else -1
def push_back(self, value: int) -> None:
self.queue.append(value)
while self.maxValue and self.maxValue[-1] < value: #比较现在和前一个的数的大小,保证pop(0)是目前最大,往后是次大
self.maxValue.pop()
self.maxValue.append(value)
def pop_front(self) -> int:
if not self.queue:
val = -1
else:
val = self.queue.pop(0)
if val == self.maxValue[0]:
self.maxValue.pop(0)
return val
# 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()
import queue
class MaxQueue:
def __init__(self):
self.queue = queue.Queue()
self.deque = queue.deque()
def max_value(self) -> int:
return self.deque[0] if self.deque else -1
def push_back(self, value: int) -> None:
self.queue.put(value)
while self.deque and self.deque[-1] < value:
self.deque.pop()
self.deque.append(value)
def pop_front(self) -> int:
if self.queue.empty(): return -1
val = self.queue.get()
if val == self.deque[0]:
self.deque.popleft()
return val
# 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()