同leetcode232

class MyQueue(object):

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



    def push(self, x):
        """
        Push element x to the back of queue.
        :type x: int
        :rtype: void
        """
        self.stack1.append(x)

    def pop(self):
        """
        Removes the element from in front of queue and returns that element.
        :rtype: int
        """
        while self.stack1:
            self.tmp_stack.append(self.stack1.pop())

        result=self.tmp_stack.pop()
        while self.tmp_stack:
            self.stack1.append(self.tmp_stack.pop())
        return result






    def peek(self):
        """
        Get the front element.
        :rtype: int
        """
        return self.stack1[0]


    def empty(self):
        """
        Returns whether the queue is empty.
        :rtype: bool
        """
        return not self.stack1



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