Adjusted README.md.

gazeldx · gazeldx · commit b8572cb9e173 · 2025-03-22T17:15:08.000+08:00
diff --git a/README.md b/README.md
@@ -127,6 +127,4 @@ You can skip the more difficult problems and do them later.
 # Others
 - [433. Minimum Genetic Mutation](en/1-1000/433-minimum-genetic-mutation.md) was solved in _Python_ and 3 ways.
 
-TODO: Add A* for 127?
-
 More LeetCode problems will be added soon.
diff --git a/en/3001-4000/unorganized.md b/en/3001-4000/unorganized.md
@@ -199,7 +199,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
+- 752 a star Add A* for 127?
 - 3464 https://leetcode.cn/problems/maximize-the-distance-between-points-on-a-square
 - https://leetcode.cn/problems/closest-equal-element-queries/
 - https://leetcode.cn/problems/rotate-array
@@ -232,7 +232,8 @@ Add a table to show the differences between A-Start and breadth-first search
 
 ## Other algorithm
 * 线段树 https://leetcode.cn/problems/fruits-into-baskets-iii
-* 
+
+
 
 
 https://leetcode.cn/problems/closest-equal-element-queries
