class MyStack:
def __init__(self):
self.res = []
self.helper = []
def push(self, x: int) -> None:
while self.res:
self.helper.append(self.res.pop())
self.helper.append(x)
while self.helper:
self.res.append(self.helper.pop())
def pop(self) -> int:
temp = self.res[0]
self.res.pop(0)
return temp
def top(self) -> int:
return self.res[0]
def empty(self) -> bool:
if self.res:
return False
else:
return True
leetcode 225 用队列实现栈
最新推荐文章于 2024-07-05 18:33:47 发布