思路是用两个栈A和B,A是队列的正序存储,B栈是队列的倒序存储。队列和栈A栈B的示意图如下所示:
在队列Push时的操作为:将数据直接Push进栈A中;在队列Pop时将数据从B中Pop
在做这两个操作的前提是栈A和栈B中都保持着当前队列中的元素。因此,当对A和B进行Push和Pop操作之前,我们都需要从对方栈中倒着载入数据,具体代码如下:
# -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.StackA=Stack(-1,[],0)
self.StackB=Stack(-1,[],0)
def push(self, node):#推入
if self.StackA.StackSize==0:
while self.StackB.StackSize>0:
self.StackA.push(self.StackB.pop())
self.StackA.push(node)
def pop(self):#推出
if self.StackB.StackSize==0:
while self.StackA.StackSize>0:
self.StackB.push(self.StackA.pop())
if self.StackB.StackSize==0:
return -1
else:
return self.StackB.pop()
class Stack:
def __init__(self,top,ElemList,StackSize):
self.top=top
self.ElemList=ElemList
self.StackSize=StackSize
def push(self,node):
self.ElemList.append(node)
self.top=len(self.ElemList)-1
self.StackSize+=1
def pop(self):
if self.StackSize==0:
return -1
else:
popElem=self.ElemList.pop()
self.top=len(self.ElemList)-1
self.StackSize-=1
return popElem
def clear(self):
self.top=-1
self.ElemList=[]
self.StackSize=0