用两个栈实现队列
# -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.stackA=[]
self.stackB=[]
def push(self,node):
# write code here
self.stackA.append(node)
def pop(self):
# return xx
if self.stackB:
return self.stackB.pop()
elif not self.stackA:
return None
else:
while self.stackA:
self.stackB.append(self.stackA.pop())
return self.stackB.pop()
用连个队列实现栈
# -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.queueA=[]
self.queueB=[]
def push(self,node):
# write code here
if self.queueB:
self.queueB.append(node)
else:
self.queueA.append(node)
def pop(self):
# return xx
if self.queueB:
i = 1
length = len(self.queueB)
while self.queueB and i < length :
self.queueA.append(self.queueB.pop(0))
i += 1
return self.queueB.pop(0)
elif self.queueA :
i=1
length=len(self.queueA)
while self.queueA and i self.queueB.append(self.queueA.pop(0)) i+=1 return self.queueA.pop(0) else: return None 版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。