class Solution:
stack1 = []
stack2 = []
def push(self, node):
self.stack1.append(node)
def pop(self):
if len(self.stack2) == 0:
for i in range(len(self.stack1)):
val = self.stack1.pop()
self.stack2.append(val)
return self.stack2.pop()
用两个栈来实现一个队列
最新推荐文章于 2021-03-02 01:18:39 发布