LeetCode 剑指 Offer 09. 用两个栈实现队列

示例 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.queueListOut = []
        self.queueListTemp = []
    def appendTail(self, value: int) -> None:
        self.queueListTemp.append(value)

    def deleteHead(self) -> int:
        if len(self.queueListOut) <= 0 and len(self.queueListTemp)<= 0: return -1
        if len(self.queueListOut) != 0:
            return self.queueListOut.pop()
        while len(self.queueListTemp) != 0:
            self.queueListOut.append(self.queueListTemp.pop())
        return self.queueListOut.pop()