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.
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).

Python:

class Queue(object):
def __init__(self):
    """
    initialize your data structure here.
    """
    self.stack_in = []
    self.stack_out = []

def push(self, x):
    """
    :type x: int
    :rtype: nothing
    """
    self.stack_in.append(x)

def pop(self):
    """
    :rtype: nothing
    """
    self.check()
    return self.stack_out.pop()

def peek(self):
    """
    :rtype: int
    """
    self.check()
    return self.stack_out[-1]

def empty(self):
    """
    :rtype: bool
    """
    return (not self.stack_in) and (not self.stack_out)

def check(self):
    if self.stack_out == []:
        while (self.stack_in != []):
            self.stack_out.append(self.stack_in.pop())