我的算法之路33--用栈实现队列

class MyQueue:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.l1=[]
        self.l2=[]

    def push(self, x: int) -> None:
        """
        Push element x to the back of queue.
        """
        self.l1.append(x)

    def pop(self) -> int:
        """
        Removes the element from in front of queue and returns that element.
        """
        if self.l2:
            return self.l2.pop(-1)
        if self.l1:
            for i in range(len(self.l1)):
                self.l2.append(self.l1.pop(-1))
            return self.l2.pop(-1)
        return None
        
    def peek(self) -> int:
        """
        Get the front element.
        """
        if self.l2:
            return self.l2[-1]
        if self.l1:
            for i in range(len(self.l1)):
                self.l2.append(self.l1.pop(-1))
            return self.l2[-1]
        return None

    def empty(self) -> bool:
        """
        Returns whether the queue is empty.
        """
        if self.l1 or self.l2:
            return False
        return True
        

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