# -*- coding:utf-8 -*-
from pythonds.basic.stack import Stack
class Solution:
def __init__(self):
self.stack1 = []
self.stack2 = []
def push(self, node):
# write code here
self.stack1.append(node)
def pop(self):
# return xx
if self.stack2 ==[]:
while self.stack1:
self.stack2.append(self.stack1.pop())
return self.stack2.pop()
data=[1,2,3,4,5]
temp=Solution()
temp.push(data)
res=temp.pop()
print(res)
两个栈实现一个队列——Python
最新推荐文章于 2022-03-15 15:35:13 发布