Update 225.implement-stack-using-queues.py

Author: chAwater

225.implement-stack-using-queues.py

@@ -29,6 +29,35 @@ def empty(self) -> bool:
             return False
 
 
+class MyStack:
+    '''
+    Date: 2023.08.05
+    Pass/Error/Bug: 1/0/0
+    执行用时：   48 ms, 在所有 Python3 提交中击败了 22.37% 的用户
+    内存消耗：15.54 MB, 在所有 Python3 提交中击败了 69.77% 的用户
+    '''
+    def __init__(self):
+        self.queue = []
+
+    def push(self, x: int) -> None:
+        self.queue.append(x)
+        total_n = len(self.queue)
+        for i in range(total_n-1):
+            self.queue.append(self.queue.pop(0))
+
+    def pop(self) -> int:
+        x = self.queue.pop(0)
+        return x
+
+    def top(self) -> int:
+        return self.queue[0]
+
+    def empty(self) -> bool:
+        if len(self.queue) == 0:
+            return True
+        else:
+            return False
+
 
 # Your MyStack object will be instantiated and called as such:
 # obj = MyStack()