题解 | #用两个栈实现队列# | Python

# -*- coding:utf-8 -*-
class Solution:
    def __init__(self):
        self.stack1 = []
        self.stack2 = []
    def push(self, node):
        self.stack1.append(node)
    def pop(self):
        ans = self.stack1[0]
        self.stack1 = self.stack1[1:]
        return ans