class Queue:
def __init__(self):
self.stack1 = []
self.stack2 = []
def appendTail(self, value):
self.stack1.append(value)
def deleteHead(self):
if not self.stack1 and not self.stack2:
print("队列为空")
return None
if not self.stack2:
while self.stack1:
self.stack2.append(self.stack1.pop())
return self.stack2.pop()
else:
return self.stack2.pop()
两个栈实现队列
最新推荐文章于 2024-02-21 17:10:17 发布