剑指Offer 09.用两个栈实现队列(Python)

题目描述

用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 appendTail 和 deleteHead ，分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素，deleteHead 操作返回 -1 )
例1：

输入：
["CQueue","appendTail","deleteHead","deleteHead"]
[[],[3],[],[]]
输出：[null,null,3,-1]

例2：

输入：
["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
[[],[],[5],[2],[],[]]
输出：[null,-1,null,null,5,2]

代码：

class CQueue():
	def __init__(self):
		self.stack_a,self.stack_b = [],[]
	def appendTail(self,value):
		self.stack_a.append(value)
	def deleteHead(self):
		if self.stack_b:
			return self.stack_b.pop()
		while self.stack_a:
			self.stack_b.append(self.stack_a.pop())
		if self.stack_b:
			return self.stack_b.pop()
		else:
			return -1
	
if __name__ == "__main__":
	obj = CQueue()
	print(obj)
	obj.appendTail(3)
	print(obj)
	param_1 = obj.deleteHead()
	print(param_1)
	param_2 = obj.deleteHead()
	print(param_2)