232.用栈实现队列
题目链接/文章讲解/视频讲解:代码随想录
栈: 先进后出 队列:先进先出
若要用栈实现队列,需要两个栈,当pop的时候,将一个栈的元素push到另一个栈,然后再pop,即实现队列的
class MyQueue:
def __init__(self):
self.stack_in = []
self.stack_out = []
def push(self, x: int) -> None:
self.stack_in.append(x)
def pop(self) -> int:
if self.empty():
return None
if self.stack_out:
return self.stack_out.pop()
else:
for i in range(len(self.stack_in)):
self.stack_out.append(self.stack_in.pop())
return self.stack_out.pop()
def peek(self) -> int:
ans = self.pop()
self.stack_out.append(ans)
return ans
def empty(self) -> bool:
return not (self.stack_in or self.stack_out)
225. 用队列实现栈
题目链接/文章讲解/视频讲解:代码随想录
使用一个队列实现栈,当pop元素时,先将队列中最后一个元素之前的所有元素移除并添加到队尾,再移除第一个元素即可
class MyStack:
def __init__(self):
self.que = deque()
def push(self, x: int) -> None:
self.que.append(x)
def pop(self) -> int:
if self.empty():
return None
n = len(self.que) - 1
for i in range(n):
self.que.append(self.que.pop())
return self.que.pop()
def top(self) -> int:
if self.empty():
return None
return self.que[-1]
def empty(self) -> bool:
return not self.que
# Your MyStack object will be instantiated and called as such:
# obj = MyStack()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.top()
# param_4 = obj.empty()