LeetCode刷题笔记第225题:用队列实现栈
想法:
栈(先进后出),队列(先进先出),为了完成用队列实现栈,构建两个队列分别为队列1和队列2来完成。每次输入元素时,以队列2为跳板将元素输入队列1,从而实现栈的先进后出。
class MyStack:
def __init__(self):
"""
Initialize your data structure here.
"""
# deque双端队列
self.queue1 = collections.deque()
self.queue2 = collections.deque()
def push(self, x: int) -> None:
"""
Push element x onto stack.
"""
# 将新输入的元素加入队列2中
self.queue2.append(x)
# 当队列1不为空时,将队列1中的元素加入到队列2中,如此可以将新输入的元素排在旧元素的前面
while self.queue1:
self.queue2.append(self.queue1.popleft())
# 将队列1与队列2中元素互换,保证队列2中为空为下一个输入元素做准备
self.queue1, self.queue2 = self.queue2, self.queue1
def pop(self) -> int:
"""
Removes the element on top of the stack and returns that element.
"""
return self.queue1.popleft()
def top(self) -> int:
"""
Get the top element.
"""
return self.queue1[0]
def empty(self) -> bool:
"""
Returns whether the stack is empty.
"""
return not self.queue1