剑指 Offer 09. 用两个栈实现队列
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )
class CQueue:
def __init__(self):
self.stack1 = []
self.stack2 = []
def appendTail(self, value: int) -> None:
self.stack1.append(value)
def deleteHead(self) -> int:
n = len(self.stack1)
if n == 0:
return -1
if n == 1:
returnData = self.stack1[0]
self.stack1 = []
return returnData
for i in range(n):
self.stack2.append(self.stack1[n-i-1])
returnData = self.stack2[-1]
self.stack1 = []
for i in range(n-1):
self.stack1.append(self.stack2[n-2-i])
self.stack2 = []
return returnData