Leetcode - 232. Implement Queue using Stacks (栈和队列)

Implement the following operations of a queue using stacks.

• push(x) -- Push element x to the back of queue.
• pop() -- Removes the element from in front of queue.
• peek() -- Get the front element.
• empty() -- Return whether the queue is empty.

Example:

MyQueue queue = new MyQueue();

queue.push(1);
queue.push(2);  
queue.peek();  // returns 1
queue.pop();   // returns 1
queue.empty(); // returns false

Notes:

• You must use only standard operations of a stack -- which means only push to top, peek/pop from top, size, and is empty operations are valid.
• Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
• You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).

class MyQueue:
    def __init__(self):
        self.stack1 = []
        self.stack2 = []
        self.size = 0

    def push(self,x):

        if len(self.stack2)!=0:
            while len(self.stack2) != 0:
                self.stack1.append(self.stack2.pop())

        self.stack1.append(x)
        self.size += 1

        
    def pop(self):
        if len(self.stack1) == 0 and len(self.stack2) == 0:
            return None

        if len(self.stack2)!=0:
            while len(self.stack1)!=0:
                self.stack2.append(self.stack1.pop())

        self.size -=1

        return self.stack2.pop()

    def peek(self):
        if self.stack2:
            return self.stack2[-1]
        else:
            while len(self.stack1)!=0:
                self.stack2.append(self.stack1.pop())

        return self.stack2[-1]

    def empty(self):
        return self.size == 0