diff --git a/problems/0225.用队列实现栈.md b/problems/0225.用队列实现栈.md
index c45917db..3457c4b3 100644
--- a/problems/0225.用队列实现栈.md
+++ b/problems/0225.用队列实现栈.md
@@ -354,6 +354,32 @@ class MyStack:
         return len(self.queue_in) == 0
 
 ```
+优化，使用一个队列实现
+```python
+class MyStack:
+
+    def __init__(self):
+        self.que = deque()
+
+    def push(self, x: int) -> None:
+        self.que.append(x)
+
+    def pop(self) -> int:
+        if self.empty():
+            return None
+        for i in range(len(self.que)-1):
+            self.que.append(self.que.popleft())
+        return self.que.popleft()
+
+    def top(self) -> int:
+        if self.empty():
+            return None
+        return self.que[-1]
+
+    def empty(self) -> bool:
+        return not self.que
+```
+
 
 Go：