Leetcode 剑指 Offer 09.用两个栈实现队列 Python 3

Leetcode 剑指 Offer 09题的解法参考代码如下： 

class CQueue:

    def __init__(self):
        self.queue=[]


    def appendTail(self, value: int) -> None:
        self.queue.append(value)


    def deleteHead(self) -> int:
        try:
            value=self.queue.pop(0)
            return value
        except Exception:
            return -1



# Your CQueue object will be instantiated and called as such:
# obj = CQueue()
# obj.appendTail(value)
# param_2 = obj.deleteHead()

题目链接：

https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof