剑指offer之两个栈完成队列的进出操作

python代码

# -*- coding:utf-8 -*-
class Solution:
    def __init__(self):
        self.stack1 = []
        self.stack2 = []
        
    def push(self, node):
        # write code here
        self.stack1.append(node)
    def pop(self):
        # return xx
        if len(self.stack2) == 0:
            while self.stack1:
                a = self.stack1.pop()
                self.stack2.append(a)
            return self.stack2.pop()
        return self.stack2.pop()

需要自己加上初始化函数；