leetcode225 Implement Stack usin

原题链接：https://leetcode.com/problems/implement-stack-using-queues/

Implement the following operations of a stack using queues.

push(x) -- Push element x onto stack.
pop() -- Removes the element on top of the stack.
top() -- Get the top element.
empty() -- Return whether the stack is empty.
Example:

MyStack stack = new MyStack();

stack.push(1);
stack.push(2);
stack.top(); // returns 2
stack.pop(); // returns 2
stack.empty(); // returns false
Notes:

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

from collections import deque
class MyStack:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.deque1 = deque()
        

    def push(self, x: int) -> None:
        """
        Push element x onto stack.
        """
        self.deque1.append(x)
        for i in range(len(self.deque1) - 1):
            self.deque1.append(self.deque1.popleft())

    def pop(self) -> int:
        """
        Removes the element on top of the stack and returns that element.
        """
        
        return self.deque1.popleft()
        

    def top(self) -> int:
        """
        Get the top element.
        """
        a = self.deque1[0]
        return a
        

    def empty(self) -> bool:
        """
        Returns whether the stack is empty.
        """
        return not self.deque1