9、两个栈实现队列（Python）

# -*- coding:utf-8 -*-
class Solution:
    def __init__(self):
        self.acceptStack = []   # 接受元素的栈
        self.outputStack = []   # 弹出元素的栈
    def push(self, node):
        # write code here
        self.acceptStack.append(node)
    def pop(self):
        if self.outputStack == []:
            while self.acceptStack:
                self.outputStack.append(self.acceptStack.pop())
        if self.outputStack != []:
            return self.outputStack.pop()
        else:
            None