752-open-the-lock.md Reworded.

gazeldx · gazeldx · commit 114309016f79 · 2025-02-16T08:43:36.000+08:00
diff --git a/en/1-1000/752-open-the-lock.md b/en/1-1000/752-open-the-lock.md
@@ -63,17 +63,19 @@ We can think of this problem as a shortest path problem on a graph: there are `1
 
 * `Breadth-First Search` emphasizes first-in-first-out, so a **queue** is needed.
 
-### Solution 2: A* (A-Star) Algorithm
+### Solution 2: A* (A-Star) Search Algorithm
 
 **A-Star Algorithm** can be used to improve the performance of **Breadth-First Search Algorithm**.
 
 **Breadth-First Search** treats each vertex equally, which inevitably leads to poor 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!
+The `A* (A-star) search 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
+_A* (A-star) search algorithm_ is similar to _Dijkstra's algorithm_, but the `target vertex` of _A* (A-star) search algorithm_ is clear, while that of _Dijkstra's algorithm_ is not. _Dijkstra's algorithm_ calculates the `distance` from the `starting vertex` to the `vertex` it reaches.
+
+#### A* (A-Star) Search 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).
+2. The **heuristic 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 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
@@ -83,7 +85,7 @@ The `A* (A-Star) algorithm` calculates the **distance** between each `vertex` an
 * Time: `O(10^4)`.
 * Space: `O(N)`.
 
-### Solution 2: A* (A-Star) Algorithm
+### Solution 2: A* (A-Star) Search Algorithm
 * Time: `O(5 * 4 * 4 * 2 + N)`.
 * Space: `O(N)`.
 
@@ -141,7 +143,7 @@ def closest_digits(digit):
     return (digit - 1, digit + 1)
 ```
 
-### Solution 2: A* (A-Star) Algorithm
+### Solution 2: A* (A-Star) Search Algorithm
 ```python
 class Solution:
     def openLock(self, deadends: List[str], target_digits: str) -> int:
diff --git a/en/3001-4000/unorganized.md b/en/3001-4000/unorganized.md
@@ -195,6 +195,7 @@ Add a table to show the differences between A-Start and breadth-first search
 - 1584-min-cost-to-connect-all-points-2.md
 - 1514-path-with-maximum-probability.md
 - 1334 https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
+- 752 a star
 
 ## other finished problems
 - https://leetcode.com/problems/k-closest-points-to-origin/
diff --git a/zh/1-1000/752-open-the-lock.md b/zh/1-1000/752-open-the-lock.md
@@ -74,7 +74,7 @@
 
 #### A* (A-Star) 算法的两（三）个关键动作
 1. 要用 `priority_queue`。
-2. 计算距离的函数要**精心设计**。设计不好，将导致不易察觉的结果错误!
+2. 计算距离的`启发式函数`要**精心设计**。设计不好，将导致不易察觉的结果错误!
 3. 在特殊情况下，单纯地用`距离`作为`priority_queue`的排序依据还不够，还要**调整一下**（比如与`步数`变量值相加），以使最后几步能精确（本例子不涉及，但这个例子 [1197. Minimum Knight Moves](https://leetcode.com/problems/minimum-knight-moves/) 涉及）。
 
 ## 复杂度
