225. Implement Stack using Queues

import queue

class MyStack:

    def __init__(self):
        self.queue = queue.Queue()

    def push(self, x: int):
        self.queue.put(x)
        
        # 일단 넣고 다시 정렬함
        for _ in range(self.queue.qsize() - 1):
            self.queue.put(self.queue.get())

    def pop(self):
        return self.queue.get()

    def top(self):
        top = self.queue.get()

        self.queue.put(top)
        for _ in range(self.queue.qsize() - 1):
            self.queue.put(self.queue.get())

        return top

    def empty(self):
        if self.queue.empty():
            return True

        return False

[문제]
https://leetcode.com/problems/implement-stack-using-queues/