力扣-232. 用栈实现队列

思路：

        使用双栈的方法，将栈一出栈的元素原封不动的加入到栈二，将出栈的顺序改变

class MyQueue:

    def __init__(self):

        self.in1 = []
        self.out = []

    def push(self, x: int) -> None:
        self.in1.append(x)

    def pop(self) -> int:
        if self.empty():
            return None
        if self.out:
            return self.out.pop()
        else:
            for i in range(len(self.in1)):
                self.out.append(self.in1.pop())
            return self.out.pop()


    def peek(self) -> int:
        ans = self.pop()
        self.out.append(ans)
        return ans

    def empty(self) -> bool:
        return not (self.in1 or self.out)


# Your MyQueue object will be instantiated and called as such:
# obj = MyQueue()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.peek()
# param_4 = obj.empty()