Reworded.

gazeldx · gazeldx · commit bb350be04977 · 2025-02-16T06:11:08.000+08:00
diff --git a/README.md b/README.md
@@ -121,6 +121,6 @@ You can skip the more difficult problems and do them later.
 - [752. Open the Lock](en/1-1000/752-open-the-lock.md) was solved in _Python_ and 2 ways.
 
 # Others
-- [433. Minimum Genetic Mutation](en/1-1000/433-minimum-genetic-mutation.md) was solved in _Python_.
+- [433. Minimum Genetic Mutation](en/1-1000/433-minimum-genetic-mutation.md) was solved in _Python_ and 2 ways.
 
 More LeetCode problems will be added soon.
diff --git a/en/1-1000/752-open-the-lock.md b/en/1-1000/752-open-the-lock.md
@@ -69,12 +69,12 @@ We can think of this problem as a shortest path problem on a graph: there are `1
 
 **Breadth-First Search** treats each vertex equally, which inevitably leads to poor performance.
 
-**A-Star Algorithm** calculates the **distance** between each `vertex` and the `target vertex`, and prioritizes vertices with close distances, which greatly improves performance.
+The `A* (A-Star) algorithm` calculates the **distance** between each `vertex` and the `target vertex`, and **prioritizes vertices with closer distances**, which is equivalent to indicating which vertex to process next, so the performance is greatly improved!
 
 #### A* (A-Star) Algorithm Has Two (or Three) Key Actions
 1. Use `priority_queue`.
 2. The function for calculating `distance` should be **carefully designed** (poor design will lead to **subtle** errors in the results).
-3. In special cases, simply using `distance` as the sorting basis for `priority_queue` is not enough, and you need to **make some adjustments**, such as adding it to the `step_count` variable value (not involved in this example).
+3. In special cases, simply using `distance` as the sorting basis of `priority_queue` is not enough, and it is also necessary to **adjust** (for example, add it to the `number of steps` variable value) to make the last few steps accurate (not involved in this example, yet in this one [1197. Minimum Knight Moves](https://leetcode.com/problems/minimum-knight-moves/)).
 
 ## Complexity
 > `N` is the length of `deadends`.
diff --git a/zh/1-1000/752-open-the-lock.md b/zh/1-1000/752-open-the-lock.md
@@ -70,14 +70,14 @@
 
 `广度优先搜索` 对每一个顶点都同等对待，这样难免性能会差。
 
-`A* (A-Star) 算法` 会对每一个`顶点`与`目标顶点`的**距离**进行计算，**距离近的顶点优先处理**，性能提升会很大。
+`A* (A-Star) 算法` 会对每一个`顶点`与`目标顶点`的**距离**进行计算，**距离近的顶点优先处理**，相当于为下一步处理哪个顶点指明了方向，因此性能有很大的提升！
 
 #### A* (A-Star) 算法的两（三）个关键动作
 1. 要用 `priority_queue`。
 2. 计算距离的函数要**精心设计**。设计不好，将导致不易察觉的结果错误!
-3. 在特殊情况下，单纯地用`距离`作为`priority_queue`的排序依据还不够，还要**调整一下**，比如与`步数`变量值相加（本例子不涉及）。
+3. 在特殊情况下，单纯地用`距离`作为`priority_queue`的排序依据还不够，还要**调整一下**（比如与`步数`变量值相加），以使最后几步能精确（本例子不涉及，但这个例子 [1197. Minimum Knight Moves](https://leetcode.com/problems/minimum-knight-moves/) 涉及）。
 
-## Complexity
+## 复杂度
 > `N` 是 `deadends.length`.
 
 ### 题解 1: 广度优先搜索
