leetcode 232 用栈实现队列

这个题是很有趣也很强的一道题。首先栈是不可能完美实现队列的，每次peek或者pop都会导致一次接近O(N)的操作，把左边数组移到右边。然后就不用管了。如果右边有数就都是O(1)的操作。

class MyQueue:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.s1 = []
        self.s2 = []
        self.front = None


    def push(self, x: int) -> None:
        """
        Push element x to the back of queue.
        """
        if len(self.s1) == 0: self.front = x
        self.s1.append(x)


    def pop(self) -> int:
        """
        Removes the element from in front of queue and returns that element.
        """
        if self.s2: return self.s2.pop()
        while self.s1: self.s2.append(self.s1.pop())
        return self.s2.pop()


    def peek(self) -> int:
        """
        Get the front element.
        """
        if self.s2: return self.s2[-1]
        return self.front


    def empty(self) -> bool:
        """
        Returns whether the queue is empty.
        """
        return not (len(self.s1) + len(self.s2))


# 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()