225-implement-stack-using-queues.md Reworded.

gazeldx · gazeldx · commit ba02f7f5646e · 2025-01-20T06:50:17.000+08:00
diff --git a/en/1-1000/225-implement-stack-using-queues.md b/en/1-1000/225-implement-stack-using-queues.md
@@ -44,9 +44,6 @@ myStack.empty(); // return False
 - At most `100` calls will be made to `push`, `pop`, `top`, and `empty`.
 - All the calls to `pop` and `top` are valid.
 
-### [Follow-up]
-Can you implement the stack using only one queue?
-
 ## Intuition
 1. Two queues are used, one for input and output, and the other for temporary storage.
 2. There are two options for using queues to simulate the functions of a stack:
@@ -60,11 +57,15 @@ Can you implement the stack using only one queue?
 * Space: `O(n)`.
 
 ## Follow-up
+Can you implement the stack using only one queue?
+
+### Follow-up Intuition
 - You can use only one queue to make it. The only change is in the `push` method. Just find a way to insert `x` to the front of the queue without using another `queue_temp`.
-- When implementing the `push` method, first `queue.push(x)`, then execute `queue.length - 1` times `queue.push(queue.pop())`. The complete code is attached in `JavaScript` section.
+- When implementing the `push` method, first `queue.push(x)`, so that `x` is inserted at the tail (back) of the queue, but we need to put `x` at the head (front) of the queue.
+- Execute `queue.length - 1` times `queue.push(queue.pop())` to move all the data before `x` to the back of `x`. The complete code is attached in the `JavaScript` section.
 
 ## JavaScript
-### Solution for option 2
+### "Option 2" solution
 ```javascript
 var MyStack = function () {
   this.queue = []
@@ -100,7 +101,7 @@ MyStack.prototype.empty = function () {
 };
 ```
 
-### Follow-up solution: use only one queue
+### "Follow-up" solution: use only one queue
 ```javascript
 var MyStack = function () {
   this.queue = []
@@ -129,7 +130,7 @@ MyStack.prototype.empty = function () {
 ```
 
 ## Python
-### Solution for option 1: Not recommended, for comparison only.
+### "Option 1" solution: Not recommended, for comparison only.
 ```python
 class MyStack:
     def __init__(self):
@@ -172,7 +173,7 @@ class MyStack:
         return not self.queue
 ```
 
-### Solution for option 2: It is short and easy to understand (recommended).
+### "Option 2" solution: It is short and easy to understand (recommended).
 ```python
 class MyStack:
     def __init__(self):
diff --git a/zh/1-1000/225-implement-stack-using-queues.md b/zh/1-1000/225-implement-stack-using-queues.md
@@ -43,10 +43,6 @@ myStack.empty(); // 返回 False
 - 最多调用 `100` 次 `push`、`pop`、`top` 和 `empty`
 - 每次调用 `pop` 和 `top` 都保证栈不为空
 
-### [进阶]
-你能否仅用一个队列来实现栈？
-
-# 中文题解
 ## 思路
 1. 使用的两个队列，一个队列用于输入和输出，另一个队列用于临时存储。
 2. 用队列模拟栈的功能，有两种方案可供选择：
@@ -60,8 +56,13 @@ myStack.empty(); // 返回 False
 * 空间：`O(n)`。
 
 ## 进阶
+你能否仅用一个队列来实现栈？
+
+### 进阶思路
 - 可以只用一个队列实现栈。改动只在`push`方法。只需要想办法不借助另一个`queue_temp`，把`x`插入到队列的头部。
-- 在实现`push`方法时，先`queue.push(x)`，然后，执行`queue.length - 1`次`queue.push(queue.pop())`即可。完整代码附在`JavaScript`章节中。
+- 在实现`push`方法时，先`queue.push(x)`，这样，`x`就被插入到了队列尾部，但我们需要把`x`放到队列的头部。
+- 把`x`前面的所有数据依次出队列，再入队列，就可以了。
+- 执行`queue.length - 1`次`queue.push(queue.pop())`即可。完整代码附在`JavaScript`章节中。
 
 ## JavaScript
 ### 方案二
