Replaced LeetCode Solution with Best Practices of LeetCode Solutions.

gazeldx · gazeldx · commit e20d7750656a · 2025-01-25T07:00:09.000+08:00
diff --git a/en/1-1000/1-two-sum.md b/en/1-1000/1-two-sum.md
@@ -1,4 +1,4 @@
-# 1. Two Sum - LeetCode Solution Best Practice
+# 1. Two Sum - Best Practices of LeetCode Solutions
 LeetCode link: [1. Two Sum](https://leetcode.com/problems/two-sum), difficulty: **Easy**
 
 ## Description of "1. Two Sum"
diff --git a/en/1-1000/15-3sum.md b/en/1-1000/15-3sum.md
@@ -1,4 +1,4 @@
-# 15. 3Sum - LeetCode Solution Best Practice
+# 15. 3Sum - Best Practices of LeetCode Solutions
 LeetCode link: [15. 3Sum](https://leetcode.com/problems/3sum), difficulty: **Medium**
 
 ## Description of "15. 3Sum"
diff --git a/en/1-1000/160-intersection-of-two-linked-lists.md b/en/1-1000/160-intersection-of-two-linked-lists.md
@@ -1,4 +1,4 @@
-# 160. Intersection of Two Linked Lists - LeetCode Solution
+# 160. Intersection of Two Linked Lists - Best Practices of LeetCode Solutions
 LeetCode problem link: [160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists),
 [160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists)
 
diff --git a/en/1-1000/18-4sum.md b/en/1-1000/18-4sum.md
@@ -1,4 +1,4 @@
-# 18. 4Sum - LeetCode Solution Best Practice
+# 18. 4Sum - Best Practices of LeetCode Solutions
 LeetCode link: [18. 4Sum](https://leetcode.com/problems/4sum), difficulty: **Medium**
 
 ## Description of "18. 4Sum"
diff --git a/en/1-1000/19-remove-nth-node-from-end-of-list.md b/en/1-1000/19-remove-nth-node-from-end-of-list.md
@@ -1,4 +1,4 @@
-# 19. Remove Nth Node From End of List - LeetCode Solution
+# 19. Remove Nth Node From End of List - Best Practices of LeetCode Solutions
 LeetCode problem link: [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list),
 [19. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list)
 
diff --git a/en/1-1000/20-valid-parentheses.md b/en/1-1000/20-valid-parentheses.md
@@ -1,4 +1,4 @@
-# 20. Valid Parentheses - LeetCode Solution Best Practice
+# 20. Valid Parentheses - Best Practices of LeetCode Solutions
 LeetCode link: [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses), difficulty: **Easy**
 
 ## Description of "20. Valid Parentheses"
diff --git a/en/1-1000/202-happy-number.md b/en/1-1000/202-happy-number.md
@@ -1,4 +1,4 @@
-# 202. Happy Number - LeetCode Solution
+# 202. Happy Number - Best Practices of LeetCode Solutions
 LeetCode problem link: [202. Happy Number](https://leetcode.com/problems/happy-number),
 [202. 快乐数](https://leetcode.cn/problems/happy-number)
 
diff --git a/en/1-1000/203-remove-linked-list-elements.md b/en/1-1000/203-remove-linked-list-elements.md
@@ -1,4 +1,4 @@
-# 203. Remove Linked List Elements - LeetCode Solution
+# 203. Remove Linked List Elements - Best Practices of LeetCode Solutions
 LeetCode problem link: [203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements),
 [203. 移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements)
 
diff --git a/en/1-1000/206-reverse-linked-list.md b/en/1-1000/206-reverse-linked-list.md
@@ -1,4 +1,4 @@
-# 206. Reverse Linked List - LeetCode Solution
+# 206. Reverse Linked List - Best Practices of LeetCode Solutions
 LeetCode problem link: [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list),
 [206. 反转链表](https://leetcode.cn/problems/reverse-linked-list)
 
diff --git a/en/1-1000/207-course-schedule.md b/en/1-1000/207-course-schedule.md
@@ -1,4 +1,4 @@
-# 207. Course Schedule - LeetCode Solution
+# 207. Course Schedule - Best Practices of LeetCode Solutions
 LeetCode problem link: [207. Course Schedule](https://leetcode.com/problems/course-schedule)
 
 ## LeetCode problem description
diff --git a/en/1-1000/209-minimum-size-subarray-sum.md b/en/1-1000/209-minimum-size-subarray-sum.md
@@ -1,4 +1,4 @@
-# 209. Minimum Size Subarray Sum - LeetCode Solution
+# 209. Minimum Size Subarray Sum - Best Practices of LeetCode Solutions
 LeetCode problem link: [209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum),
 [209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum)
 
diff --git a/en/1-1000/225-implement-stack-using-queues.md b/en/1-1000/225-implement-stack-using-queues.md
@@ -1,4 +1,4 @@
-# 225. Implement Stack using Queues - LeetCode Solution Best Practice
+# 225. Implement Stack using Queues - Best Practices of LeetCode Solutions
 LeetCode link: [225. Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues), difficulty: **Easy**
 
 ## Description of "225. Implement Stack using Queues"
diff --git a/en/1-1000/232-implement-queue-using-stacks.md b/en/1-1000/232-implement-queue-using-stacks.md
@@ -1,4 +1,4 @@
-# 232. Implement Queue using Stacks - LeetCode Solution
+# 232. Implement Queue using Stacks - Best Practices of LeetCode Solutions
 LeetCode English link: [232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)
 
 LeetCode Chinese link: [232. 用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks)
diff --git a/en/1-1000/24-swap-nodes-in-pairs.md b/en/1-1000/24-swap-nodes-in-pairs.md
@@ -1,4 +1,4 @@
-# 24. Swap Nodes in Pairs - LeetCode Solution
+# 24. Swap Nodes in Pairs - Best Practices of LeetCode Solutions
 LeetCode problem link: [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs),
 [24. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs)
 
diff --git a/en/1-1000/242-valid-anagram.md b/en/1-1000/242-valid-anagram.md
@@ -1,4 +1,4 @@
-# 242. Valid Anagram - LeetCode Solution
+# 242. Valid Anagram - Best Practices of LeetCode Solutions
 LeetCode problem link: [242. Valid Anagram](https://leetcode.com/problems/valid-anagram),
 [242. 有效的字母异位词](https://leetcode.cn/problems/valid-anagram)
 
diff --git a/en/1-1000/27-remove-element.md b/en/1-1000/27-remove-element.md
@@ -1,4 +1,4 @@
-# 27. Remove Element - LeetCode Solution
+# 27. Remove Element - Best Practices of LeetCode Solutions
 LeetCode problem link: [27. Remove Element](https://leetcode.com/problems/remove-element)
 
 ## LeetCode problem description
diff --git a/en/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md b/en/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
@@ -1,4 +1,4 @@
-# 28. Find the Index of the First Occurrence in a String - LeetCode Solution
+# 28. Find the Index of the First Occurrence in a String - Best Practices of LeetCode Solutions
 LeetCode English link: [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string)
 
 LeetCode Chinese link: [28. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string)
diff --git a/en/1-1000/303-range-sum-query-immutable.md b/en/1-1000/303-range-sum-query-immutable.md
@@ -1,4 +1,4 @@
-# 303. Range Sum Query - Immutable - LeetCode Solution
+# 303. Range Sum Query - Immutable - Best Practices of LeetCode Solutions
 LeetCode problem link: [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable)
 
 ## LeetCode problem description
diff --git a/en/1-1000/344-reverse-string.md b/en/1-1000/344-reverse-string.md
@@ -1,4 +1,4 @@
-# 344. Reverse String - LeetCode Solution
+# 344. Reverse String - Best Practices of LeetCode Solutions
 LeetCode problem link: [344. Reverse String](https://leetcode.com/problems/reverse-string),
 [344. 反转字符串](https://leetcode.cn/problems/reverse-string)
 
diff --git a/en/1-1000/349-intersection-of-two-arrays.md b/en/1-1000/349-intersection-of-two-arrays.md
@@ -1,4 +1,4 @@
-# 349. Intersection of Two Arrays - LeetCode Solution
+# 349. Intersection of Two Arrays - Best Practices of LeetCode Solutions
 LeetCode problem link: [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays),
 [349. 两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays)
 
diff --git a/en/1-1000/383-ransom-note.md b/en/1-1000/383-ransom-note.md
@@ -1,4 +1,4 @@
-# 383. Ransom Note - LeetCode Solution
+# 383. Ransom Note - Best Practices of LeetCode Solutions
 LeetCode problem link: [383. Ransom Note](https://leetcode.com/problems/ransom-note),
 [383. 赎金信](https://leetcode.cn/problems/ransom-note)
 
diff --git a/en/1-1000/454-4sum-ii.md b/en/1-1000/454-4sum-ii.md
@@ -1,4 +1,4 @@
-# 454. 4Sum II - LeetCode Solution
+# 454. 4Sum II - Best Practices of LeetCode Solutions
 LeetCode problem link: [454. 4Sum II](https://leetcode.com/problems/4sum-ii),
 [454. 四数相加 II](https://leetcode.cn/problems/4sum-ii)
 
diff --git a/en/1-1000/459-repeated-substring-pattern.md b/en/1-1000/459-repeated-substring-pattern.md
@@ -1,4 +1,4 @@
-# 459. Repeated Substring Pattern - LeetCode Solution Best Practice
+# 459. Repeated Substring Pattern - Best Practices of LeetCode Solutions
 LeetCode link: [459. Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern), difficulty: **Easy**.
 
 ## Description of "459. Repeated Substring Pattern"
diff --git a/en/1-1000/541-reverse-string-ii.md b/en/1-1000/541-reverse-string-ii.md
@@ -1,4 +1,4 @@
-# 541. Reverse String II - LeetCode Solution
+# 541. Reverse String II - Best Practices of LeetCode Solutions
 LeetCode problem link: [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii),
 [541. 反转字符串 II](https://leetcode.cn/problems/reverse-string-ii)
 
diff --git a/en/1-1000/59-spiral-matrix-ii.md b/en/1-1000/59-spiral-matrix-ii.md
@@ -1,4 +1,4 @@
-# 59. Spiral Matrix II - LeetCode Solution
+# 59. Spiral Matrix II - Best Practices of LeetCode Solutions
 LeetCode problem link: [59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii)
 
 ## LeetCode problem description
diff --git a/en/1-1000/704-binary-search.md b/en/1-1000/704-binary-search.md
@@ -1,4 +1,4 @@
-# 704. Binary Search - LeetCode Solution
+# 704. Binary Search - Best Practices of LeetCode Solutions
 LeetCode problem link: [704. Binary Search](https://leetcode.com/problems/binary-search)
 
 ## LeetCode problem description
diff --git a/en/1-1000/707-design-linked-list.md b/en/1-1000/707-design-linked-list.md
@@ -1,4 +1,4 @@
-# 707. Design Linked List - LeetCode Solution
+# 707. Design Linked List - Best Practices of LeetCode Solutions
 LeetCode problem link: [707. Design Linked List](https://leetcode.com/problems/design-linked-list),
 [707. 设计链表](https://leetcode.cn/problems/design-linked-list)
 
diff --git a/en/1-1000/977-squares-of-a-sorted-array.md b/en/1-1000/977-squares-of-a-sorted-array.md
@@ -1,4 +1,4 @@
-# 977. Squares of a Sorted Array - LeetCode Solution
+# 977. Squares of a Sorted Array - Best Practices of LeetCode Solutions
 LeetCode problem link: [977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)
 
 ## LeetCode problem description
diff --git a/en/1001-2000/1584-min-cost-to-connect-all-points-2.md b/en/1001-2000/1584-min-cost-to-connect-all-points-2.md
@@ -1,4 +1,4 @@
-# 1584. Min Cost to Connect All Points - LeetCode Solution (Kruskal's Algorithm)
+# 1584. Min Cost to Connect All Points - Best Practices of LeetCode Solutions (Kruskal's Algorithm)
 LeetCode problem link: [1584. Min Cost to Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points)
 
 ## LeetCode problem description
diff --git a/en/1001-2000/1584-min-cost-to-connect-all-points.md b/en/1001-2000/1584-min-cost-to-connect-all-points.md
@@ -1,4 +1,4 @@
-# 1584. Min Cost to Connect All Points - LeetCode Solution (Prim's Algorithm)
+# 1584. Min Cost to Connect All Points - Best Practices of LeetCode Solutions (Prim's Algorithm)
 LeetCode problem link: [1584. Min Cost to Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points)
 
 ## LeetCode problem description
diff --git a/en/3001-4000/unorganized.md b/en/3001-4000/unorganized.md
@@ -80,7 +80,7 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
 - 102 https://leetcode.cn/problems/binary-tree-level-order-traversal/
     - 107 https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/
     - 199 https://leetcode.cn/problems/binary-tree-right-side-view/
-    - 637 https://leetcode.cn/problems/average-of-levels-in-binary-tree/submissions/594783150/
+    - 637 https://leetcode.cn/problems/average-of-levels-in-binary-tree/
     - 429 https://leetcode.cn/problems/n-ary-tree-level-order-traversal/
     - 515 https://leetcode.cn/problems/find-largest-value-in-each-tree-row/
     - 116 https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/
@@ -104,7 +104,10 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
 - 654 https://leetcode.cn/problems/maximum-binary-tree/
 - 617 https://leetcode.cn/problems/merge-two-binary-trees/
 - 700 https://leetcode.cn/problems/search-in-a-binary-search-tree/
-
+- 530 https://leetcode.cn/problems/minimum-absolute-difference-in-bst/
+    783 https://leetcode.com/problems/minimum-distance-between-bst-nodes/ is the same
+- 501 https://leetcode.cn/problems/find-mode-in-binary-search-tree/
+- 
 ### Failed in 2 rounds
 - 222 https://leetcode.cn/problems/count-complete-tree-nodes/
-
+- 236 https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/
diff --git a/zh/1-1000/160-intersection-of-two-linked-lists.md b/zh/1-1000/160-intersection-of-two-linked-lists.md
@@ -1,4 +1,4 @@
-# 160. Intersection of Two Linked Lists - LeetCode Solution
+# 160. Intersection of Two Linked Lists - Best Practices of LeetCode Solutions
 LeetCode problem link: [160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists),
 [160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists)
 
diff --git a/zh/1-1000/19-remove-nth-node-from-end-of-list.md b/zh/1-1000/19-remove-nth-node-from-end-of-list.md
@@ -1,4 +1,4 @@
-# 19. Remove Nth Node From End of List - LeetCode Solution
+# 19. Remove Nth Node From End of List - Best Practices of LeetCode Solutions
 LeetCode problem link: [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list),
 [19. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list)
 
diff --git a/zh/1-1000/202-happy-number.md b/zh/1-1000/202-happy-number.md
@@ -1,4 +1,4 @@
-# 202. Happy Number - LeetCode Solution
+# 202. Happy Number - Best Practices of LeetCode Solutions
 LeetCode problem link: [202. Happy Number](https://leetcode.com/problems/happy-number),
 [202. 快乐数](https://leetcode.cn/problems/happy-number)
 
diff --git a/zh/1-1000/203-remove-linked-list-elements.md b/zh/1-1000/203-remove-linked-list-elements.md
@@ -1,4 +1,4 @@
-# 203. Remove Linked List Elements - LeetCode Solution
+# 203. Remove Linked List Elements - Best Practices of LeetCode Solutions
 LeetCode problem link: [203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements),
 [203. 移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements)
 
diff --git a/zh/1-1000/206-reverse-linked-list.md b/zh/1-1000/206-reverse-linked-list.md
@@ -1,4 +1,4 @@
-# 206. Reverse Linked List - LeetCode Solution
+# 206. Reverse Linked List - Best Practices of LeetCode Solutions
 LeetCode problem link: [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list),
 [206. 反转链表](https://leetcode.cn/problems/reverse-linked-list)
 
diff --git a/zh/1-1000/207-course-schedule.md b/zh/1-1000/207-course-schedule.md
@@ -1,4 +1,4 @@
-# 207. Course Schedule - LeetCode Solution
+# 207. Course Schedule - Best Practices of LeetCode Solutions
 LeetCode problem link: [207. Course Schedule](https://leetcode.com/problems/course-schedule)
 
 ## LeetCode problem description
diff --git a/zh/1-1000/209-minimum-size-subarray-sum.md b/zh/1-1000/209-minimum-size-subarray-sum.md
@@ -1,4 +1,4 @@
-# 209. Minimum Size Subarray Sum - LeetCode Solution
+# 209. Minimum Size Subarray Sum - Best Practices of LeetCode Solutions
 LeetCode problem link: [209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum),
 [209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum)
 
diff --git a/zh/1-1000/232-implement-queue-using-stacks.md b/zh/1-1000/232-implement-queue-using-stacks.md
@@ -1,4 +1,4 @@
-# 232. Implement Queue using Stacks - LeetCode Solution
+# 232. Implement Queue using Stacks - Best Practices of LeetCode Solutions
 LeetCode English link: [232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)
 
 LeetCode Chinese link: [232. 用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks)
diff --git a/zh/1-1000/24-swap-nodes-in-pairs.md b/zh/1-1000/24-swap-nodes-in-pairs.md
@@ -1,4 +1,4 @@
-# 24. Swap Nodes in Pairs - LeetCode Solution
+# 24. Swap Nodes in Pairs - Best Practices of LeetCode Solutions
 LeetCode problem link: [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs),
 [24. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs)
 
diff --git a/zh/1-1000/242-valid-anagram.md b/zh/1-1000/242-valid-anagram.md
@@ -1,4 +1,4 @@
-# 242. Valid Anagram - LeetCode Solution
+# 242. Valid Anagram - Best Practices of LeetCode Solutions
 LeetCode problem link: [242. Valid Anagram](https://leetcode.com/problems/valid-anagram),
 [242. 有效的字母异位词](https://leetcode.cn/problems/valid-anagram)
 
diff --git a/zh/1-1000/27-remove-element.md b/zh/1-1000/27-remove-element.md
@@ -1,4 +1,4 @@
-# 27. Remove Element - LeetCode Solution
+# 27. Remove Element - Best Practices of LeetCode Solutions
 LeetCode problem link: [27. Remove Element](https://leetcode.com/problems/remove-element)
 
 ## LeetCode problem description
diff --git a/zh/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md b/zh/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
@@ -1,4 +1,4 @@
-# 28. Find the Index of the First Occurrence in a String - LeetCode Solution
+# 28. Find the Index of the First Occurrence in a String - Best Practices of LeetCode Solutions
 LeetCode English link: [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string)
 
 LeetCode Chinese link: [28. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string)
diff --git a/zh/1-1000/303-range-sum-query-immutable.md b/zh/1-1000/303-range-sum-query-immutable.md
@@ -1,4 +1,4 @@
-# 303. Range Sum Query - Immutable - LeetCode Solution
+# 303. Range Sum Query - Immutable - Best Practices of LeetCode Solutions
 LeetCode problem link: [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable)
 
 ## LeetCode problem description
diff --git a/zh/1-1000/344-reverse-string.md b/zh/1-1000/344-reverse-string.md
@@ -1,4 +1,4 @@
-# 344. Reverse String - LeetCode Solution
+# 344. Reverse String - Best Practices of LeetCode Solutions
 LeetCode problem link: [344. Reverse String](https://leetcode.com/problems/reverse-string),
 [344. 反转字符串](https://leetcode.cn/problems/reverse-string)
 
diff --git a/zh/1-1000/349-intersection-of-two-arrays.md b/zh/1-1000/349-intersection-of-two-arrays.md
@@ -1,4 +1,4 @@
-# 349. Intersection of Two Arrays - LeetCode Solution
+# 349. Intersection of Two Arrays - Best Practices of LeetCode Solutions
 LeetCode problem link: [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays),
 [349. 两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays)
 
diff --git a/zh/1-1000/383-ransom-note.md b/zh/1-1000/383-ransom-note.md
@@ -1,4 +1,4 @@
-# 383. Ransom Note - LeetCode Solution
+# 383. Ransom Note - Best Practices of LeetCode Solutions
 LeetCode problem link: [383. Ransom Note](https://leetcode.com/problems/ransom-note),
 [383. 赎金信](https://leetcode.cn/problems/ransom-note)
 
diff --git a/zh/1-1000/454-4sum-ii.md b/zh/1-1000/454-4sum-ii.md
@@ -1,4 +1,4 @@
-# 454. 4Sum II - LeetCode Solution
+# 454. 4Sum II - Best Practices of LeetCode Solutions
 LeetCode problem link: [454. 4Sum II](https://leetcode.com/problems/4sum-ii),
 [454. 四数相加 II](https://leetcode.cn/problems/4sum-ii)
 
diff --git a/zh/1-1000/541-reverse-string-ii.md b/zh/1-1000/541-reverse-string-ii.md
@@ -1,4 +1,4 @@
-# 541. Reverse String II - LeetCode Solution
+# 541. Reverse String II - Best Practices of LeetCode Solutions
 LeetCode problem link: [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii),
 [541. 反转字符串 II](https://leetcode.cn/problems/reverse-string-ii)
 
diff --git a/zh/1-1000/59-spiral-matrix-ii.md b/zh/1-1000/59-spiral-matrix-ii.md
@@ -1,4 +1,4 @@
-# 59. Spiral Matrix II - LeetCode Solution
+# 59. Spiral Matrix II - Best Practices of LeetCode Solutions
 LeetCode problem link: [59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii)
 
 ## LeetCode problem description
diff --git a/zh/1-1000/704-binary-search.md b/zh/1-1000/704-binary-search.md
@@ -1,4 +1,4 @@
-# 704. Binary Search - LeetCode Solution
+# 704. Binary Search - Best Practices of LeetCode Solutions
 LeetCode problem link: [704. Binary Search](https://leetcode.com/problems/binary-search)
 
 ## LeetCode problem description
diff --git a/zh/1-1000/707-design-linked-list.md b/zh/1-1000/707-design-linked-list.md
@@ -1,4 +1,4 @@
-# 707. Design Linked List - LeetCode Solution
+# 707. Design Linked List - Best Practices of LeetCode Solutions
 LeetCode problem link: [707. Design Linked List](https://leetcode.com/problems/design-linked-list),
 [707. 设计链表](https://leetcode.cn/problems/design-linked-list)
 
diff --git a/zh/1-1000/977-squares-of-a-sorted-array.md b/zh/1-1000/977-squares-of-a-sorted-array.md
@@ -1,4 +1,4 @@
-# 977. Squares of a Sorted Array - LeetCode Solution
+# 977. Squares of a Sorted Array - Best Practices of LeetCode Solutions
 LeetCode problem link: [977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)
 
 ## LeetCode problem description
diff --git a/zh/1001-2000/1584-min-cost-to-connect-all-points-2.md b/zh/1001-2000/1584-min-cost-to-connect-all-points-2.md
@@ -1,4 +1,4 @@
-# 1584. Min Cost to Connect All Points - LeetCode Solution (Kruskal's Algorithm)
+# 1584. Min Cost to Connect All Points - Best Practices of LeetCode Solutions (Kruskal's Algorithm)
 LeetCode problem link: [1584. Min Cost to Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points)
 
 ## LeetCode problem description
diff --git a/zh/1001-2000/1584-min-cost-to-connect-all-points.md b/zh/1001-2000/1584-min-cost-to-connect-all-points.md
@@ -1,4 +1,4 @@
-# 1584. Min Cost to Connect All Points - LeetCode Solution (Prim's Algorithm)
+# 1584. Min Cost to Connect All Points - Best Practices of LeetCode Solutions (Prim's Algorithm)
 LeetCode problem link: [1584. Min Cost to Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points)
 
 ## LeetCode problem description
