From d82af7ba917e2ec26198d4afbe641016836c5540 Mon Sep 17 00:00:00 2001
From: yanglbme <szuyanglb@outlook.com>
Date: Thu, 25 Jan 2024 15:13:36 +0800
Subject: [PATCH] feat: update solutions to lc problems

---
 lcci/10.03.Search Rotate Array/README.md      |  2 +-
 lcci/10.03.Search Rotate Array/README_EN.md   |  2 +-
 lcci/16.14.Best Line/README.md                |  2 +-
 lcci/17.06.Number Of 2s In Range/README.md    |  4 ++-
 lcci/17.21.Volume of Histogram/README.md      |  2 +-
 lcci/17.23.Max Black Square/README.md         |  2 +-
 .../README.md"                                | 12 ++++-----
 .../README.md"                                |  4 +--
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../0000-0099/0039.Combination Sum/README.md  |  6 ++---
 .../0039.Combination Sum/README_EN.md         |  6 ++---
 .../0040.Combination Sum II/README.md         |  6 ++---
 .../0040.Combination Sum II/README_EN.md      |  6 ++---
 .../0000-0099/0045.Jump Game II/README.md     |  6 ++---
 .../0000-0099/0045.Jump Game II/README_EN.md  |  6 ++---
 .../0000-0099/0046.Permutations/README.md     |  2 +-
 .../0000-0099/0046.Permutations/README_EN.md  |  2 +-
 .../0000-0099/0047.Permutations II/README.md  |  2 +-
 .../0047.Permutations II/README_EN.md         |  2 +-
 solution/0000-0099/0055.Jump Game/README.md   |  6 ++---
 .../0000-0099/0055.Jump Game/README_EN.md     |  6 ++---
 .../0000-0099/0077.Combinations/README.md     |  6 ++---
 .../0000-0099/0077.Combinations/README_EN.md  |  6 ++---
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../0149.Max Points on a Line/README.md       |  2 +-
 .../0216.Combination Sum III/README.md        |  6 ++---
 .../0233.Number of Digit One/README.md        | 12 ++++-----
 .../0247.Strobogrammatic Number II/README.md  |  4 ++-
 .../0248.Strobogrammatic Number III/README.md |  4 ++-
 .../0200-0299/0279.Perfect Squares/README.md  |  2 +-
 .../0296.Best Meeting Point/README.md         |  4 +--
 solution/0300-0399/0322.Coin Change/README.md |  2 +-
 .../README.md                                 |  4 ++-
 .../README.md                                 | 12 ++++-----
 .../README.md                                 |  4 ++-
 .../0413.Arithmetic Slices/README.md          |  4 +--
 .../README.md                                 |  4 ++-
 .../README.md                                 |  4 +--
 .../0486.Predict the Winner/README.md         |  2 +-
 .../0487.Max Consecutive Ones II/README.md    |  4 ++-
 .../README.md                                 | 12 ++++-----
 .../0616.Add Bold Tag in String/README.md     |  5 +++-
 .../0640.Solve the Equation/README.md         |  4 ++-
 .../0678.Valid Parenthesis String/README.md   |  4 ++-
 .../0687.Longest Univalue Path/README.md      |  4 ++-
 .../README.md                                 |  2 +-
 .../0700-0799/0724.Find Pivot Index/README.md |  4 +--
 .../README.md                                 |  4 ++-
 .../0758.Bold Words in String/README.md       |  5 +++-
 .../0767.Reorganize String/README.md          |  4 +--
 .../0777.Swap Adjacent in LR String/README.md |  4 ++-
 .../0700-0799/0788.Rotated Digits/README.md   | 16 ++++++-----
 .../README.md                                 |  4 ++-
 .../0834.Sum of Distances in Tree/README.md   |  2 +-
 .../0856.Score of Parentheses/README.md       | 12 ++++-----
 .../0856.Score of Parentheses/README_EN.md    | 27 ++++++++++++++++++-
 .../README.md                                 |  4 ++-
 solution/0800-0899/0877.Stone Game/README.md  |  2 +-
 .../README.md                                 | 12 ++++-----
 .../0927.Three Equal Parts/README.md          |  2 +-
 .../0940.Distinct Subsequences II/README.md   |  2 +-
 .../1004.Max Consecutive Ones III/README.md   |  8 ++++--
 .../README.md                                 | 12 ++++-----
 .../1017.Convert to Base -2/README.md         |  2 +-
 .../1000-1099/1024.Video Stitching/README.md  |  6 ++---
 .../1029.Two City Scheduling/README.md        |  2 +-
 .../README.md                                 |  2 +-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  4 ++-
 .../1065.Index Pairs of a String/README.md    |  4 +--
 .../1067.Digit Count in Range/README.md       |  4 ++-
 .../README.md                                 |  2 +-
 .../README.md                                 |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  4 +--
 .../README_EN.md                              |  4 +--
 .../1200-1299/1245.Tree Diameter/README.md    |  2 +-
 .../1200-1299/1245.Tree Diameter/README_EN.md |  2 +-
 .../README.md                                 |  4 +--
 .../README_EN.md                              |  4 +--
 .../README.md                                 |  2 +-
 .../README.md                                 |  6 ++---
 .../README.md                                 |  2 +-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  2 +-
 .../README.md                                 |  4 +--
 .../README.md                                 |  6 +++--
 .../README.md                                 |  2 +-
 .../README.md                                 |  4 +--
 .../1755.Closest Subsequence Sum/README.md    |  4 ++-
 .../1774.Closest Dessert Cost/README.md       |  4 ++-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  2 +-
 .../README.md                                 |  2 +-
 .../README.md                                 |  2 +-
 .../README.md                                 |  4 +--
 .../1994.The Number of Good Subsets/README.md |  2 +-
 .../README.md                                 |  2 +-
 .../2008.Maximum Earnings From Taxi/README.md |  4 +--
 .../README_EN.md                              |  4 +--
 .../README.md                                 |  2 +-
 .../2104.Sum of Subarray Ranges/README.md     |  4 ++-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  2 +-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../2312.Selling Pieces of Wood/README.md     |  4 ++-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  4 ++-
 .../README.md                                 |  4 +--
 .../README.md                                 |  4 ++-
 .../2360.Longest Cycle in a Graph/README.md   |  4 ++-
 .../2376.Count Special Integers/README.md     | 12 ++++-----
 .../README.md                                 |  4 ++-
 .../2402.Meeting Rooms III/README.md          |  2 +-
 .../2402.Meeting Rooms III/README_EN.md       |  2 +-
 .../README.md                                 |  4 +--
 .../README_EN.md                              |  4 +--
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  4 +--
 .../README_EN.md                              |  4 +--
 .../README.md                                 |  2 +-
 .../2603.Collect Coins in a Tree/README.md    |  2 +-
 .../2603.Collect Coins in a Tree/README_EN.md |  2 +-
 .../2600-2699/2611.Mice and Cheese/README.md  |  2 +-
 .../2719.Count of Integers/README.md          |  2 +-
 .../2719.Count of Integers/README_EN.md       |  2 +-
 .../README.md                                 |  2 +-
 .../2736.Maximum Sum Queries/README.md        |  2 +-
 .../2736.Maximum Sum Queries/README_EN.md     |  2 +-
 .../README.md                                 |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 .../README.md                                 |  2 +-
 .../README_EN.md                              |  2 +-
 163 files changed, 365 insertions(+), 258 deletions(-)

diff --git a/lcci/10.03.Search Rotate Array/README.md b/lcci/10.03.Search Rotate Array/README.md
index 8356baf6d54ec..67a3267740c61 100644
--- a/lcci/10.03.Search Rotate Array/README.md	
+++ b/lcci/10.03.Search Rotate Array/README.md	
@@ -40,7 +40,7 @@
 
 相似题目：
 
--   [81. 搜索旋转排序数组 II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md)
+-   [81. 搜索旋转排序数组 II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/lcci/10.03.Search Rotate Array/README_EN.md b/lcci/10.03.Search Rotate Array/README_EN.md
index bf1dcafd5bda5..ee9b485e6dab3 100644
--- a/lcci/10.03.Search Rotate Array/README_EN.md	
+++ b/lcci/10.03.Search Rotate Array/README_EN.md	
@@ -46,7 +46,7 @@ The time complexity is approximately $O(\log n)$, and the space complexity is $O
 
 Similar problems:
 
--   [81. Search in Rotated Sorted Array II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md)
+-   [81. Search in Rotated Sorted Array II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/lcci/16.14.Best Line/README.md b/lcci/16.14.Best Line/README.md
index 92ba1a29236b4..6da7b59acbe52 100644
--- a/lcci/16.14.Best Line/README.md	
+++ b/lcci/16.14.Best Line/README.md	
@@ -148,7 +148,7 @@ func bestLine(points [][]int) []int {
 
 相似题目：
 
--   [149. 直线上最多的点数](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md)
+-   [149. 直线上最多的点数](https://github.com/doocs/leetcode/blob/main/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md)
 
 <!-- tabs:start -->
 
diff --git a/lcci/17.06.Number Of 2s In Range/README.md b/lcci/17.06.Number Of 2s In Range/README.md
index 9e1cbd50d5a41..84cde5282c08d 100644
--- a/lcci/17.06.Number Of 2s In Range/README.md	
+++ b/lcci/17.06.Number Of 2s In Range/README.md	
@@ -47,7 +47,9 @@ $$
 
 时间复杂度 $O(\log n)$。
 
-相似题目：[233. 数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
+相似题目：
+
+-   [233. 数字 1 的个数](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
 
 <!-- tabs:start -->
 
diff --git a/lcci/17.21.Volume of Histogram/README.md b/lcci/17.21.Volume of Histogram/README.md
index 944a4e428b5ac..5e34e0cf62e49 100644
--- a/lcci/17.21.Volume of Histogram/README.md	
+++ b/lcci/17.21.Volume of Histogram/README.md	
@@ -26,7 +26,7 @@
 
 相似题目：
 
--   [42. 接雨水](/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md)
+-   [42. 接雨水](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md)
 
 <!-- tabs:start -->
 
diff --git a/lcci/17.23.Max Black Square/README.md b/lcci/17.23.Max Black Square/README.md
index 78f51194a2505..172c5d7b0091e 100644
--- a/lcci/17.23.Max Black Square/README.md	
+++ b/lcci/17.23.Max Black Square/README.md	
@@ -65,7 +65,7 @@ $$
 
 相似题目：
 
--   [1139. 最大的以 1 为边界的正方形](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md)
+-   [1139. 最大的以 1 为边界的正方形](https://github.com/doocs/leetcode/blob/main/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md)
 
 <!-- tabs:start -->
 
diff --git "a/lcof/\351\235\242\350\257\225\351\242\23043. 1\357\275\236n\346\225\264\346\225\260\344\270\2551\345\207\272\347\216\260\347\232\204\346\254\241\346\225\260/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23043. 1\357\275\236n\346\225\264\346\225\260\344\270\2551\345\207\272\347\216\260\347\232\204\346\254\241\346\225\260/README.md"
index 57f5bd367fb25..7aee462c056fc 100644
--- "a/lcof/\351\235\242\350\257\225\351\242\23043. 1\357\275\236n\346\225\264\346\225\260\344\270\2551\345\207\272\347\216\260\347\232\204\346\254\241\346\225\260/README.md"	
+++ "b/lcof/\351\235\242\350\257\225\351\242\23043. 1\357\275\236n\346\225\264\346\225\260\344\270\2551\345\207\272\347\216\260\347\232\204\346\254\241\346\225\260/README.md"	
@@ -66,12 +66,12 @@ $$
 
 相似题目：
 
--   [357. 统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
--   [600. 不含连续 1 的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
--   [788. 旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md)
--   [902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
--   [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
--   [2376. 统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
+-   [357. 统计各位数字都不同的数字个数](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
+-   [600. 不含连续 1 的非负整数](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
+-   [788. 旋转数字](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0788.Rotated%20Digits/README.md)
+-   [902. 最大为 N 的数字组合](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
+-   [1012. 至少有 1 位重复的数字](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
+-   [2376. 统计特殊整数](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
 
 <!-- tabs:start -->
 
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 012. \345\267\246\345\217\263\344\270\244\350\276\271\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214\347\233\270\347\255\211/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 012. \345\267\246\345\217\263\344\270\244\350\276\271\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214\347\233\270\347\255\211/README.md"
index d422a1298b80f..8f1410dff2c2f 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 012. \345\267\246\345\217\263\344\270\244\350\276\271\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214\347\233\270\347\255\211/README.md"	
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 012. \345\267\246\345\217\263\344\270\244\350\276\271\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214\347\233\270\347\255\211/README.md"	
@@ -70,8 +70,8 @@
 
 相似题目：
 
--   [1991. 找到数组的中间位置](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md)
--   [2574. 左右元素和的差值](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md)
+-   [1991. 找到数组的中间位置](https://github.com/doocs/leetcode/blob/main/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md)
+-   [2574. 左右元素和的差值](https://github.com/doocs/leetcode/blob/main/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md
index 0323ca3d1b1b2..819711519137f 100644
--- a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md	
+++ b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md	
@@ -81,7 +81,7 @@ for (int i = 0; i &lt; k; i++) {
 
 相似题目：
 
--   [80. 删除有序数组中的重复项 II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md)
+-   [80. 删除有序数组中的重复项 II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md
index 750403f44f588..63b20145767a4 100644
--- a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md	
+++ b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md	
@@ -80,7 +80,7 @@ The original problem requires that the same number appear at most once. We can e
 
 Similar problems:
 
--   [80. Remove Duplicates from Sorted Array II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md)
+-   [80. Remove Duplicates from Sorted Array II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0039.Combination Sum/README.md b/solution/0000-0099/0039.Combination Sum/README.md
index 57bd3080816cc..5bbe0ddc7c91d 100644
--- a/solution/0000-0099/0039.Combination Sum/README.md	
+++ b/solution/0000-0099/0039.Combination Sum/README.md	
@@ -66,9 +66,9 @@
 
 相似题目：
 
--   [40. 组合总和 II](/solution/0000-0099/0040.Combination%20Sum%20II/README.md)
--   [77. 组合](/solution/0000-0099/0077.Combinations/README.md)
--   [216. 组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md)
+-   [40. 组合总和 II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0040.Combination%20Sum%20II/README.md)
+-   [77. 组合](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0077.Combinations/README.md)
+-   [216. 组合总和 III](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0216.Combination%20Sum%20III/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0039.Combination Sum/README_EN.md b/solution/0000-0099/0039.Combination Sum/README_EN.md
index 85c947a7e9067..5388555cce7dc 100644
--- a/solution/0000-0099/0039.Combination Sum/README_EN.md	
+++ b/solution/0000-0099/0039.Combination Sum/README_EN.md	
@@ -64,9 +64,9 @@ The time complexity is $O(2^n \times n)$, and the space complexity is $O(n)$. He
 
 Similar problems:
 
--   [40. Combination Sum II](/solution/0000-0099/0040.Combination%20Sum%20II/README_EN.md)
--   [77. Combinations](/solution/0000-0099/0077.Combinations/README_EN.md)
--   [216. Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md)
+-   [40. Combination Sum II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0040.Combination%20Sum%20II/README_EN.md)
+-   [77. Combinations](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0077.Combinations/README_EN.md)
+-   [216. Combination Sum III](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0040.Combination Sum II/README.md b/solution/0000-0099/0040.Combination Sum II/README.md
index 28c0acb016080..cb2195ea22eeb 100644
--- a/solution/0000-0099/0040.Combination Sum II/README.md	
+++ b/solution/0000-0099/0040.Combination Sum II/README.md	
@@ -64,9 +64,9 @@
 
 相似题目：
 
--   [39. 组合总和](/solution/0000-0099/0039.Combination%20Sum/README.md)
--   [77. 组合](/solution/0000-0099/0077.Combinations/README.md)
--   [216. 组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md)
+-   [39. 组合总和](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0039.Combination%20Sum/README.md)
+-   [77. 组合](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0077.Combinations/README.md)
+-   [216. 组合总和 III](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0216.Combination%20Sum%20III/README.md)
 
 <!-- 这里可写通用的实现逻辑 -->
 
diff --git a/solution/0000-0099/0040.Combination Sum II/README_EN.md b/solution/0000-0099/0040.Combination Sum II/README_EN.md
index 3ae4e055d70da..d9ec3f97eef44 100644
--- a/solution/0000-0099/0040.Combination Sum II/README_EN.md	
+++ b/solution/0000-0099/0040.Combination Sum II/README_EN.md	
@@ -62,9 +62,9 @@ The time complexity is $O(2^n \times n)$, and the space complexity is $O(n)$. He
 
 Similar problems:
 
--   [39. Combination Sum](/solution/0000-0099/0039.Combination%20Sum/README_EN.md)
--   [77. Combinations](/solution/0000-0099/0077.Combinations/README_EN.md)
--   [216. Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md)
+-   [39. Combination Sum](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0039.Combination%20Sum/README_EN.md)
+-   [77. Combinations](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0077.Combinations/README_EN.md)
+-   [216. Combination Sum III](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0045.Jump Game II/README.md b/solution/0000-0099/0045.Jump Game II/README.md
index 099004e339357..fe6867f28b571 100644
--- a/solution/0000-0099/0045.Jump Game II/README.md	
+++ b/solution/0000-0099/0045.Jump Game II/README.md	
@@ -59,9 +59,9 @@
 
 相似题目：
 
--   [55. 跳跃游戏](/solution/0000-0099/0055.Jump%20Game/README.md)
--   [1024. 视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md)
--   [1326. 灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md)
+-   [55. 跳跃游戏](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0055.Jump%20Game/README.md)
+-   [1024. 视频拼接](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1024.Video%20Stitching/README.md)
+-   [1326. 灌溉花园的最少水龙头数目](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0045.Jump Game II/README_EN.md b/solution/0000-0099/0045.Jump Game II/README_EN.md
index c83def951a0e1..5bdde20d1f44c 100644
--- a/solution/0000-0099/0045.Jump Game II/README_EN.md	
+++ b/solution/0000-0099/0045.Jump Game II/README_EN.md	
@@ -54,9 +54,9 @@ The time complexity is $O(n)$, where $n$ is the length of the array. The space c
 
 Similar problems:
 
--   [55. Jump Game](/solution/0000-0099/0055.Jump%20Game/README_EN.md)
--   [1024. Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README_EN.md)
--   [1326. Minimum Number of Taps to Open to Water a Garden](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md)
+-   [55. Jump Game](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0055.Jump%20Game/README_EN.md)
+-   [1024. Video Stitching](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1024.Video%20Stitching/README_EN.md)
+-   [1326. Minimum Number of Taps to Open to Water a Garden](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0046.Permutations/README.md b/solution/0000-0099/0046.Permutations/README.md
index 0287c3bcb8b44..2937e38009e87 100644
--- a/solution/0000-0099/0046.Permutations/README.md
+++ b/solution/0000-0099/0046.Permutations/README.md
@@ -51,7 +51,7 @@
 
 相似题目：
 
--   [47. 全排列 II](/solution/0000-0099/0047.Permutations%20II/README.md)
+-   [47. 全排列 II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0047.Permutations%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0046.Permutations/README_EN.md b/solution/0000-0099/0046.Permutations/README_EN.md
index 4fe9ddd2d242b..1da51c1e1c0f6 100644
--- a/solution/0000-0099/0046.Permutations/README_EN.md
+++ b/solution/0000-0099/0046.Permutations/README_EN.md
@@ -36,7 +36,7 @@ The time complexity is $O(n \times n!)$, where $n$ is the length of the array. T
 
 Similar problems:
 
--   [47. Permutations II](/solution/0000-0099/0047.Permutations%20II/README_EN.md)
+-   [47. Permutations II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0047.Permutations%20II/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0047.Permutations II/README.md b/solution/0000-0099/0047.Permutations II/README.md
index a592c39cacdcf..273d2c5382fa6 100644
--- a/solution/0000-0099/0047.Permutations II/README.md	
+++ b/solution/0000-0099/0047.Permutations II/README.md	
@@ -53,7 +53,7 @@
 
 相似题目：
 
--   [46. 全排列](/solution/0000-0099/0046.Permutations/README.md)
+-   [46. 全排列](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0046.Permutations/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0047.Permutations II/README_EN.md b/solution/0000-0099/0047.Permutations II/README_EN.md
index 444bb0794057c..52fe49d63d76c 100644
--- a/solution/0000-0099/0047.Permutations II/README_EN.md	
+++ b/solution/0000-0099/0047.Permutations II/README_EN.md	
@@ -49,7 +49,7 @@ The time complexity is $O(n \times n!)$, and the space complexity is $O(n)$. Her
 
 Similar problems:
 
--   [46. Permutations](/solution/0000-0099/0046.Permutations/README_EN.md)
+-   [46. Permutations](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0046.Permutations/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0055.Jump Game/README.md b/solution/0000-0099/0055.Jump Game/README.md
index c9d3f477f9ea3..db159f3660521 100644
--- a/solution/0000-0099/0055.Jump Game/README.md	
+++ b/solution/0000-0099/0055.Jump Game/README.md	
@@ -51,9 +51,9 @@
 
 相似题目：
 
--   [45. 跳跃游戏 II](/solution/0000-0099/0045.Jump%20Game%20II/README.md)
--   [1024. 视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md)
--   [1326. 灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md)
+-   [45. 跳跃游戏 II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0045.Jump%20Game%20II/README.md)
+-   [1024. 视频拼接](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1024.Video%20Stitching/README.md)
+-   [1326. 灌溉花园的最少水龙头数目](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0055.Jump Game/README_EN.md b/solution/0000-0099/0055.Jump Game/README_EN.md
index e574cef19339d..e7b4c23f723ab 100644
--- a/solution/0000-0099/0055.Jump Game/README_EN.md	
+++ b/solution/0000-0099/0055.Jump Game/README_EN.md	
@@ -47,9 +47,9 @@ The time complexity is $O(n)$, where $n$ is the length of the array. The space c
 
 Similar problems:
 
--   [45. Jump Game II](/solution/0000-0099/0045.Jump%20Game%20II/README_EN.md)
--   [1024. Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README_EN.md)
--   [1326. Minimum Number of Taps to Open to Water a Garden](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md)
+-   [45. Jump Game II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0045.Jump%20Game%20II/README_EN.md)
+-   [1024. Video Stitching](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1024.Video%20Stitching/README_EN.md)
+-   [1326. Minimum Number of Taps to Open to Water a Garden](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0077.Combinations/README.md b/solution/0000-0099/0077.Combinations/README.md
index 942e17967ebff..53e9f062133c6 100644
--- a/solution/0000-0099/0077.Combinations/README.md
+++ b/solution/0000-0099/0077.Combinations/README.md
@@ -61,9 +61,9 @@
 
 相似题目：
 
--   [39. 组合总和](/solution/0000-0099/0039.Combination%20Sum/README.md)
--   [40. 组合总和 II](/solution/0000-0099/0040.Combination%20Sum%20II/README.md)
--   [216. 组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md)
+-   [39. 组合总和](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0039.Combination%20Sum/README.md)
+-   [40. 组合总和 II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0040.Combination%20Sum%20II/README.md)
+-   [216. 组合总和 III](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0216.Combination%20Sum%20III/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0077.Combinations/README_EN.md b/solution/0000-0099/0077.Combinations/README_EN.md
index fbf60245f0371..03be6d897e1ac 100644
--- a/solution/0000-0099/0077.Combinations/README_EN.md
+++ b/solution/0000-0099/0077.Combinations/README_EN.md
@@ -54,9 +54,9 @@ The time complexity is $(C_n^k \times k)$, and the space complexity is $O(k)$. H
 
 Similar problems:
 
--   [39. Combination Sum](/solution/0000-0099/0039.Combination%20Sum/README_EN.md)
--   [40. Combination Sum II](/solution/0000-0099/0040.Combination%20Sum%20II/README_EN.md)
--   [216. Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md)
+-   [39. Combination Sum](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0039.Combination%20Sum/README_EN.md)
+-   [40. Combination Sum II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0040.Combination%20Sum%20II/README_EN.md)
+-   [216. Combination Sum III](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md
index e0031396abd37..e7a93b21a2e88 100644
--- a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md	
+++ b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md	
@@ -80,7 +80,7 @@ for (int i = 0; i &lt; len; i++) {
 
 相似题目：
 
--   [26. 删除有序数组中的重复项](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md)
+-   [26. 删除有序数组中的重复项](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md
index c59153e876250..89515545cae1f 100644
--- a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md	
+++ b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md	
@@ -79,7 +79,7 @@ The original problem requires that the same number appears at most $2$ times. We
 
 Similar problems:
 
--   [26. Remove Duplicates from Sorted Array](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md)
+-   [26. Remove Duplicates from Sorted Array](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0100-0199/0149.Max Points on a Line/README.md b/solution/0100-0199/0149.Max Points on a Line/README.md
index a368bc2f8e9e6..a9054f126c010 100644
--- a/solution/0100-0199/0149.Max Points on a Line/README.md	
+++ b/solution/0100-0199/0149.Max Points on a Line/README.md	
@@ -179,7 +179,7 @@ public class Solution {
 
 相似题目：
 
--   [面试题 16.14. 最佳直线](/lcci/16.14.Best%20Line/README.md)
+-   [面试题 16.14. 最佳直线](https://github.com/doocs/leetcode/blob/main/lcci/16.14.Best%20Line/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0200-0299/0216.Combination Sum III/README.md b/solution/0200-0299/0216.Combination Sum III/README.md
index 9c1f8bc797a47..56caf1f13f7fd 100644
--- a/solution/0200-0299/0216.Combination Sum III/README.md	
+++ b/solution/0200-0299/0216.Combination Sum III/README.md	
@@ -288,9 +288,9 @@ public class Solution {
 
 相似题目：
 
--   [39. 组合总和](/solution/0000-0099/0039.Combination%20Sum/README.md)
--   [40. 组合总和 II](/solution/0000-0099/0040.Combination%20Sum%20II/README.md)
--   [77. 组合](/solution/0000-0099/0077.Combinations/README.md)
+-   [39. 组合总和](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0039.Combination%20Sum/README.md)
+-   [40. 组合总和 II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0040.Combination%20Sum%20II/README.md)
+-   [77. 组合](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0077.Combinations/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0200-0299/0233.Number of Digit One/README.md b/solution/0200-0299/0233.Number of Digit One/README.md
index 9ea12359b6e87..1876455a9f7c2 100644
--- a/solution/0200-0299/0233.Number of Digit One/README.md	
+++ b/solution/0200-0299/0233.Number of Digit One/README.md	
@@ -65,12 +65,12 @@ $$
 
 相似题目：
 
--   [357. 统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
--   [600. 不含连续 1 的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
--   [788. 旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md)
--   [902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
--   [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
--   [2376. 统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
+-   [357. 统计各位数字都不同的数字个数](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
+-   [600. 不含连续 1 的非负整数](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
+-   [788. 旋转数字](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0788.Rotated%20Digits/README.md)
+-   [902. 最大为 N 的数字组合](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
+-   [1012. 至少有 1 位重复的数字](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
+-   [2376. 统计特殊整数](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0200-0299/0247.Strobogrammatic Number II/README.md b/solution/0200-0299/0247.Strobogrammatic Number II/README.md
index 811cbf2fa5e74..807415f12d1b4 100644
--- a/solution/0200-0299/0247.Strobogrammatic Number II/README.md	
+++ b/solution/0200-0299/0247.Strobogrammatic Number II/README.md	
@@ -51,7 +51,9 @@
 
 时间复杂度为 $O(2^{n+2})$。
 
-相似题目：[248. 中心对称数 III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md)
+相似题目：
+
+-   [248. 中心对称数 III](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0200-0299/0248.Strobogrammatic Number III/README.md b/solution/0200-0299/0248.Strobogrammatic Number III/README.md
index c53d45ab875a2..fc5e2c7d53a98 100644
--- a/solution/0200-0299/0248.Strobogrammatic Number III/README.md	
+++ b/solution/0200-0299/0248.Strobogrammatic Number III/README.md	
@@ -59,7 +59,9 @@
 
 时间复杂度为 $O(2^{n+2}\times \log n)$。
 
-相似题目：[247. 中心对称数 II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md)
+相似题目：
+
+-   [247. 中心对称数 II](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0200-0299/0279.Perfect Squares/README.md b/solution/0200-0299/0279.Perfect Squares/README.md
index 7f47ce141622d..e2a31697d1ff9 100644
--- a/solution/0200-0299/0279.Perfect Squares/README.md	
+++ b/solution/0200-0299/0279.Perfect Squares/README.md	
@@ -68,7 +68,7 @@ $$
 
 相似题目：
 
--   [322. 零钱兑换](/solution/0300-0399/0322.Coin%20Change/README.md)
+-   [322. 零钱兑换](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0322.Coin%20Change/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0200-0299/0296.Best Meeting Point/README.md b/solution/0200-0299/0296.Best Meeting Point/README.md
index 309b07e49254d..b1f1b3f826f8e 100644
--- a/solution/0200-0299/0296.Best Meeting Point/README.md	
+++ b/solution/0200-0299/0296.Best Meeting Point/README.md	
@@ -56,8 +56,8 @@
 
 相似题目：
 
--   [462. 最少移动次数使数组元素相等 II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md)
--   [2448. 使数组相等的最小开销](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README.md)
+-   [462. 最少移动次数使数组元素相等 II](https://github.com/doocs/leetcode/blob/main/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md)
+-   [2448. 使数组相等的最小开销](https://github.com/doocs/leetcode/blob/main/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0300-0399/0322.Coin Change/README.md b/solution/0300-0399/0322.Coin Change/README.md
index 2852a942eeced..a75e4294e9115 100644
--- a/solution/0300-0399/0322.Coin Change/README.md	
+++ b/solution/0300-0399/0322.Coin Change/README.md	
@@ -78,7 +78,7 @@ $$
 
 相似题目：
 
--   [279. 完全平方数](/solution/0200-0299/0279.Perfect%20Squares/README.md)
+-   [279. 完全平方数](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0279.Perfect%20Squares/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0300-0399/0329.Longest Increasing Path in a Matrix/README.md b/solution/0300-0399/0329.Longest Increasing Path in a Matrix/README.md
index 7ff7fa2c4ac1d..2c7ea6d17cb1d 100644
--- a/solution/0300-0399/0329.Longest Increasing Path in a Matrix/README.md	
+++ b/solution/0300-0399/0329.Longest Increasing Path in a Matrix/README.md	
@@ -58,7 +58,9 @@
 
 时间复杂度 $O(m \times n)$，空间复杂度 $O(m \times n)$。其中 $m$ 和 $n$ 分别是矩阵的行数和列数。
 
-相似题目：[2328. 网格图中递增路径的数目](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README.md)。
+相似题目：
+
+-   [2328. 网格图中递增路径的数目](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0300-0399/0357.Count Numbers with Unique Digits/README.md b/solution/0300-0399/0357.Count Numbers with Unique Digits/README.md
index a93ae4a46c6d6..f97efad2dbe62 100644
--- a/solution/0300-0399/0357.Count Numbers with Unique Digits/README.md	
+++ b/solution/0300-0399/0357.Count Numbers with Unique Digits/README.md	
@@ -149,12 +149,12 @@ $$
 
 相似题目：
 
--   [233. 数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
--   [600. 不含连续 1 的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
--   [788. 旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md)
--   [902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
--   [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
--   [2376. 统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
+-   [233. 数字 1 的个数](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
+-   [600. 不含连续 1 的非负整数](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
+-   [788. 旋转数字](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0788.Rotated%20Digits/README.md)
+-   [902. 最大为 N 的数字组合](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
+-   [1012. 至少有 1 位重复的数字](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
+-   [2376. 统计特殊整数](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0300-0399/0358.Rearrange String k Distance Apart/README.md b/solution/0300-0399/0358.Rearrange String k Distance Apart/README.md
index 63c73981183f7..8a19c5a5621b7 100644
--- a/solution/0300-0399/0358.Rearrange String k Distance Apart/README.md	
+++ b/solution/0300-0399/0358.Rearrange String k Distance Apart/README.md	
@@ -56,7 +56,9 @@
 
 时间复杂度 $O(n\log n)$，其中 $n$ 是字符串 `s` 的长度。
 
-相似题目：[767. 重构字符串](/solution/0700-0799/0767.Reorganize%20String/README.md)
+相似题目：
+
+-   [767. 重构字符串](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0767.Reorganize%20String/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0400-0499/0413.Arithmetic Slices/README.md b/solution/0400-0499/0413.Arithmetic Slices/README.md
index 6463d6fe51594..ebd19cbdec10b 100644
--- a/solution/0400-0499/0413.Arithmetic Slices/README.md	
+++ b/solution/0400-0499/0413.Arithmetic Slices/README.md	
@@ -62,8 +62,8 @@
 
 相似题目：
 
--   [1513. 仅含 1 的子串数](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md)
--   [2348. 全 0 子数组的数目](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README.md)
+-   [1513. 仅含 1 的子串数](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md)
+-   [2348. 全 0 子数组的数目](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0400-0499/0452.Minimum Number of Arrows to Burst Balloons/README.md b/solution/0400-0499/0452.Minimum Number of Arrows to Burst Balloons/README.md
index e1f0bcbf32c9d..0b4dd4a6b79c8 100644
--- a/solution/0400-0499/0452.Minimum Number of Arrows to Burst Balloons/README.md	
+++ b/solution/0400-0499/0452.Minimum Number of Arrows to Burst Balloons/README.md	
@@ -60,7 +60,9 @@
 
 时间复杂度 $O(n \times \log n)$，空间复杂度 $O(\log n)$。其中 $n$ 为气球的数量。
 
-相似题目：[757. 设置交集大小至少为 2](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README.md)
+相似题目：
+
+-   [757. 设置交集大小至少为 2](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/README.md b/solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/README.md
index e6d06d5d85fd7..55855d00a6636 100644
--- a/solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/README.md	
+++ b/solution/0400-0499/0462.Minimum Moves to Equal Array Elements II/README.md	
@@ -57,8 +57,8 @@
 
 相似题目：
 
--   [296. 最佳的碰头地点](/solution/0200-0299/0296.Best%20Meeting%20Point/README.md)
--   [2448. 使数组相等的最小开销](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README.md)
+-   [296. 最佳的碰头地点](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0296.Best%20Meeting%20Point/README.md)
+-   [2448. 使数组相等的最小开销](https://github.com/doocs/leetcode/blob/main/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0400-0499/0486.Predict the Winner/README.md b/solution/0400-0499/0486.Predict the Winner/README.md
index 39eb4a4f510fc..7a15902705388 100644
--- a/solution/0400-0499/0486.Predict the Winner/README.md	
+++ b/solution/0400-0499/0486.Predict the Winner/README.md	
@@ -205,7 +205,7 @@ impl Solution {
 
 相似题目：
 
--   [877. 石子游戏](/solution/0800-0899/0877.Stone%20Game/README.md)
+-   [877. 石子游戏](https://github.com/doocs/leetcode/blob/main/solution/0800-0899/0877.Stone%20Game/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0400-0499/0487.Max Consecutive Ones II/README.md b/solution/0400-0499/0487.Max Consecutive Ones II/README.md
index d57b7bd927ed1..d94b7482fbc97 100644
--- a/solution/0400-0499/0487.Max Consecutive Ones II/README.md	
+++ b/solution/0400-0499/0487.Max Consecutive Ones II/README.md	
@@ -188,7 +188,9 @@ func findMaxConsecutiveOnes(nums []int) int {
 
 时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为 `nums` 的长度。
 
-相似题目：[1004. 最大连续 1 的个数 III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md)
+相似题目：
+
+-   [1004. 最大连续 1 的个数 III](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md)
 
 以下是滑动窗口的优化版本。
 
diff --git a/solution/0600-0699/0600.Non-negative Integers without Consecutive Ones/README.md b/solution/0600-0699/0600.Non-negative Integers without Consecutive Ones/README.md
index 46809d52be3ca..82a8ac8f25dbd 100644
--- a/solution/0600-0699/0600.Non-negative Integers without Consecutive Ones/README.md	
+++ b/solution/0600-0699/0600.Non-negative Integers without Consecutive Ones/README.md	
@@ -80,12 +80,12 @@ $$
 
 相似题目：
 
--   [233. 数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
--   [357. 统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
--   [788. 旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md)
--   [902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
--   [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
--   [2376. 统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
+-   [233. 数字 1 的个数](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
+-   [357. 统计各位数字都不同的数字个数](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
+-   [788. 旋转数字](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0788.Rotated%20Digits/README.md)
+-   [902. 最大为 N 的数字组合](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
+-   [1012. 至少有 1 位重复的数字](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
+-   [2376. 统计特殊整数](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0600-0699/0616.Add Bold Tag in String/README.md b/solution/0600-0699/0616.Add Bold Tag in String/README.md
index 639249bceeec1..8e50c9d83ee01 100644
--- a/solution/0600-0699/0616.Add Bold Tag in String/README.md	
+++ b/solution/0600-0699/0616.Add Bold Tag in String/README.md	
@@ -63,7 +63,10 @@
 
 ### 方法一：前缀树 + 区间合并
 
-相似题目：[1065. 字符串的索引对](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md)、[758. 字符串中的加粗单词](/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md)
+相似题目：
+
+-   [1065. 字符串的索引对](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md)
+-   [758. 字符串中的加粗单词](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0600-0699/0640.Solve the Equation/README.md b/solution/0600-0699/0640.Solve the Equation/README.md
index acdea8b1ca560..43e2e39e75987 100644
--- a/solution/0600-0699/0640.Solve the Equation/README.md	
+++ b/solution/0600-0699/0640.Solve the Equation/README.md	
@@ -56,7 +56,9 @@
 -   当 $x_1 = x_2$：若 $y_1 \neq y_2$，方程无解；若 $y_1=y_2$，方程有无限解。
 -   当 $x_1 \neq x_2$：方程有唯一解 $x=\frac{y_2-y_1}{x_1-x_2}$。
 
-相似题目：[592. 分数加减运算](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README.md)
+相似题目：
+
+-   [592. 分数加减运算](https://github.com/doocs/leetcode/blob/main/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0600-0699/0678.Valid Parenthesis String/README.md b/solution/0600-0699/0678.Valid Parenthesis String/README.md
index 3de1472a0f321..a15ae8aaf9556 100644
--- a/solution/0600-0699/0678.Valid Parenthesis String/README.md	
+++ b/solution/0600-0699/0678.Valid Parenthesis String/README.md	
@@ -160,7 +160,9 @@ func checkValidString(s string) bool {
 
 时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为字符串 `s` 的长度。
 
-相似题目：[2116. 判断一个括号字符串是否有效](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md)
+相似题目：
+
+-   [2116. 判断一个括号字符串是否有效](https://github.com/doocs/leetcode/blob/main/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0600-0699/0687.Longest Univalue Path/README.md b/solution/0600-0699/0687.Longest Univalue Path/README.md
index 0142e941ac33f..606c55e6d2f5f 100644
--- a/solution/0600-0699/0687.Longest Univalue Path/README.md	
+++ b/solution/0600-0699/0687.Longest Univalue Path/README.md	
@@ -44,7 +44,9 @@
 
 ### 方法一：DFS
 
-相似题目：[543. 二叉树的直径](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README.md)
+相似题目：
+
+-   [543. 二叉树的直径](https://github.com/doocs/leetcode/blob/main/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0700-0799/0712.Minimum ASCII Delete Sum for Two Strings/README.md b/solution/0700-0799/0712.Minimum ASCII Delete Sum for Two Strings/README.md
index 1876e9205ce54..3fad6de97d1ce 100644
--- a/solution/0700-0799/0712.Minimum ASCII Delete Sum for Two Strings/README.md	
+++ b/solution/0700-0799/0712.Minimum ASCII Delete Sum for Two Strings/README.md	
@@ -64,7 +64,7 @@ $$
 
 相似题目：
 
--   [1143. 最长公共子序列](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md)
+-   [1143. 最长公共子序列](https://github.com/doocs/leetcode/blob/main/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0700-0799/0724.Find Pivot Index/README.md b/solution/0700-0799/0724.Find Pivot Index/README.md
index f992042d32910..d0919e471973e 100644
--- a/solution/0700-0799/0724.Find Pivot Index/README.md	
+++ b/solution/0700-0799/0724.Find Pivot Index/README.md	
@@ -72,8 +72,8 @@
 
 相似题目：
 
--   [1991. 找到数组的中间位置](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md)
--   [2574. 左右元素和的差值](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md)
+-   [1991. 找到数组的中间位置](https://github.com/doocs/leetcode/blob/main/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md)
+-   [2574. 左右元素和的差值](https://github.com/doocs/leetcode/blob/main/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0700-0799/0757.Set Intersection Size At Least Two/README.md b/solution/0700-0799/0757.Set Intersection Size At Least Two/README.md
index eaf9cef02c9d7..7b425f80583e2 100644
--- a/solution/0700-0799/0757.Set Intersection Size At Least Two/README.md	
+++ b/solution/0700-0799/0757.Set Intersection Size At Least Two/README.md	
@@ -59,7 +59,9 @@
 
 ### 方法一：排序 + 贪心
 
-相似题目： [452. 用最少数量的箭引爆气球](/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README.md)
+相似题目：
+
+-   [452. 用最少数量的箭引爆气球](https://github.com/doocs/leetcode/blob/main/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0700-0799/0758.Bold Words in String/README.md b/solution/0700-0799/0758.Bold Words in String/README.md
index 2e711406840f2..7cd9d967c5c8b 100644
--- a/solution/0700-0799/0758.Bold Words in String/README.md	
+++ b/solution/0700-0799/0758.Bold Words in String/README.md	
@@ -46,7 +46,10 @@
 
 ### 方法一：前缀树 + 区间合并
 
-相似题目：[1065. 字符串的索引对](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md)、[616. 给字符串添加加粗标签](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md)
+相似题目：
+
+-   [1065. 字符串的索引对](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md)
+-   [616. 给字符串添加加粗标签](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0700-0799/0767.Reorganize String/README.md b/solution/0700-0799/0767.Reorganize String/README.md
index 0326377376072..ca3e0ba6f5e5f 100644
--- a/solution/0700-0799/0767.Reorganize String/README.md	
+++ b/solution/0700-0799/0767.Reorganize String/README.md	
@@ -245,8 +245,8 @@ impl Solution {
 
 相似题目：
 
--   [358. K 距离间隔重排字符串](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md)
--   [1054. 距离相等的条形码](/solution/1000-1099/1054.Distant%20Barcodes/README.md)
+-   [358. K 距离间隔重排字符串](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md)
+-   [1054. 距离相等的条形码](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1054.Distant%20Barcodes/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0700-0799/0777.Swap Adjacent in LR String/README.md b/solution/0700-0799/0777.Swap Adjacent in LR String/README.md
index 157dbc9793574..b7fe4ad0e1954 100644
--- a/solution/0700-0799/0777.Swap Adjacent in LR String/README.md	
+++ b/solution/0700-0799/0777.Swap Adjacent in LR String/README.md	
@@ -47,7 +47,9 @@ XRLXXRRLX
 
 时间复杂度 $O(n)$，其中 $n$ 表示字符串 `start` 或 `end` 的长度。
 
-相似题目：[2337. 移动片段得到字符串](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README.md)
+相似题目：
+
+-   [2337. 移动片段得到字符串](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0700-0799/0788.Rotated Digits/README.md b/solution/0700-0799/0788.Rotated Digits/README.md
index 63bbd4ceaf07f..9183ce5db1d70 100644
--- a/solution/0700-0799/0788.Rotated Digits/README.md	
+++ b/solution/0700-0799/0788.Rotated Digits/README.md	
@@ -45,7 +45,9 @@
 
 时间复杂度 $O(n\times \log n)$。
 
-相似题目：[1056. 易混淆数](/solution/1000-1099/1056.Confusing%20Number/README.md)
+相似题目：
+
+-   [1056. 易混淆数](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1056.Confusing%20Number/README.md)
 
 <!-- tabs:start -->
 
@@ -190,12 +192,12 @@ $$
 
 相似题目：
 
--   [233. 数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
--   [357. 统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
--   [600. 不含连续 1 的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
--   [902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
--   [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
--   [2376. 统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
+-   [233. 数字 1 的个数](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
+-   [357. 统计各位数字都不同的数字个数](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
+-   [600. 不含连续 1 的非负整数](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
+-   [902. 最大为 N 的数字组合](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
+-   [1012. 至少有 1 位重复的数字](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
+-   [2376. 统计特殊整数](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0700-0799/0795.Number of Subarrays with Bounded Maximum/README.md b/solution/0700-0799/0795.Number of Subarrays with Bounded Maximum/README.md
index df24a49ad61a9..b8e2be032185b 100644
--- a/solution/0700-0799/0795.Number of Subarrays with Bounded Maximum/README.md	
+++ b/solution/0700-0799/0795.Number of Subarrays with Bounded Maximum/README.md	
@@ -133,7 +133,9 @@ func numSubarrayBoundedMax(nums []int, left int, right int) int {
 
 时间复杂度 $O(n)$，空间复杂度 $O(n)$。
 
-相似题目：[907. 子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md)
+相似题目：
+
+-   [907. 子数组的最小值之和](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0800-0899/0834.Sum of Distances in Tree/README.md b/solution/0800-0899/0834.Sum of Distances in Tree/README.md
index 37e0f939b7dad..6b09755282562 100644
--- a/solution/0800-0899/0834.Sum of Distances in Tree/README.md	
+++ b/solution/0800-0899/0834.Sum of Distances in Tree/README.md	
@@ -65,7 +65,7 @@
 
 相似题目：
 
--   [2581. 统计可能的树根数目](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README.md)
+-   [2581. 统计可能的树根数目](https://github.com/doocs/leetcode/blob/main/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0800-0899/0856.Score of Parentheses/README.md b/solution/0800-0899/0856.Score of Parentheses/README.md
index 63fc020a9ab26..7701e3472a9b0 100644
--- a/solution/0800-0899/0856.Score of Parentheses/README.md	
+++ b/solution/0800-0899/0856.Score of Parentheses/README.md	
@@ -71,12 +71,12 @@
 
 括号相关类型题：
 
--   [678. 有效的括号字符串](https://github.com/doocs/leetcode/tree/main/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
--   [1021. 删除最外层的括号](https://github.com/doocs/leetcode/tree/main/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md)
--   [1096. 花括号展开 II](https://github.com/doocs/leetcode/tree/main/solution/1000-1099/1096.Brace%20Expansion%20II/README.md)
--   [1249. 移除无效的括号](https://github.com/doocs/leetcode/tree/main/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md)
--   [1541. 平衡括号字符串的最少插入次数](https://github.com/doocs/leetcode/tree/main/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md)
--   [2116. 判断一个括号字符串是否有效](https://github.com/doocs/leetcode/tree/main/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md)
+-   [678. 有效的括号字符串](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
+-   [1021. 删除最外层的括号](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md)
+-   [1096. 花括号展开 II](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1096.Brace%20Expansion%20II/README.md)
+-   [1249. 移除无效的括号](https://github.com/doocs/leetcode/blob/main/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md)
+-   [1541. 平衡括号字符串的最少插入次数](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md)
+-   [2116. 判断一个括号字符串是否有效](https://github.com/doocs/leetcode/blob/main/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0800-0899/0856.Score of Parentheses/README_EN.md b/solution/0800-0899/0856.Score of Parentheses/README_EN.md
index 1756a6c1b6609..791d4abbb2a68 100644
--- a/solution/0800-0899/0856.Score of Parentheses/README_EN.md	
+++ b/solution/0800-0899/0856.Score of Parentheses/README_EN.md	
@@ -47,7 +47,32 @@
 
 ## Solutions
 
-### Solution 1
+### Solution 1: Counting
+
+By observing, we find that `()` is the only structure that contributes to the score, and the outer parentheses just add some multipliers to this structure. So, we only need to focus on `()`.
+
+We use $d$ to maintain the current depth of parentheses. For each `(`, we increase the depth by one, and for each `)`, we decrease the depth by one. When we encounter `()`, we add $2^d$ to the answer.
+
+Let's take `(()(()))` as an example. We first find the two closed parentheses `()` inside, and then add the corresponding $2^d$ to the score. In fact, we are calculating the score of `(()) + ((()))`.
+
+```bash
+( ( ) ( ( ) ) )
+  ^ ^   ^ ^
+
+( ( ) ) + ( ( ( ) ) )
+  ^ ^         ^ ^
+```
+
+The time complexity is $O(n)$, and the space complexity is $O(1)$. Here, $n$ is the length of the string.
+
+Related problems about parentheses:
+
+-   [678. Valid Parenthesis String](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
+-   [1021. Remove Outermost Parentheses](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md)
+-   [1096. Brace Expansion II](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1096.Brace%20Expansion%20II/README.md)
+-   [1249. Minimum Remove to Make Valid Parentheses](https://github.com/doocs/leetcode/blob/main/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md)
+-   [1541. Minimum Insertions to Balance a Parentheses String](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md)
+-   [2116. Check if a Parentheses String Can Be Valid](https://github.com/doocs/leetcode/blob/main/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0800-0899/0857.Minimum Cost to Hire K Workers/README.md b/solution/0800-0899/0857.Minimum Cost to Hire K Workers/README.md
index d1bc877304d3f..1f207d58db7c8 100644
--- a/solution/0800-0899/0857.Minimum Cost to Hire K Workers/README.md	
+++ b/solution/0800-0899/0857.Minimum Cost to Hire K Workers/README.md	
@@ -58,7 +58,9 @@
 
 时间复杂度 $O(n\log n)$，空间复杂度 $O(n)$。其中 $n$ 是工人数。
 
-相似题目：[1383. 最大的团队表现值](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md)
+相似题目：
+
+-   [1383. 最大的团队表现值](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0800-0899/0877.Stone Game/README.md b/solution/0800-0899/0877.Stone Game/README.md
index 0423eee3d0430..cfe21ba428221 100644
--- a/solution/0800-0899/0877.Stone Game/README.md	
+++ b/solution/0800-0899/0877.Stone Game/README.md	
@@ -182,7 +182,7 @@ function stoneGame(piles: number[]): boolean {
 
 相似题目：
 
--   [486. 预测赢家](/solution/0400-0499/0486.Predict%20the%20Winner/README.md)
+-   [486. 预测赢家](https://github.com/doocs/leetcode/blob/main/solution/0400-0499/0486.Predict%20the%20Winner/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0900-0999/0902.Numbers At Most N Given Digit Set/README.md b/solution/0900-0999/0902.Numbers At Most N Given Digit Set/README.md
index 80c1696ddffca..7c0a93cff1815 100644
--- a/solution/0900-0999/0902.Numbers At Most N Given Digit Set/README.md	
+++ b/solution/0900-0999/0902.Numbers At Most N Given Digit Set/README.md	
@@ -87,12 +87,12 @@ $$
 
 相似题目：
 
--   [233. 数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
--   [357. 统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
--   [600. 不含连续 1 的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
--   [788. 旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md)
--   [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
--   [2376. 统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
+-   [233. 数字 1 的个数](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
+-   [357. 统计各位数字都不同的数字个数](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
+-   [600. 不含连续 1 的非负整数](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
+-   [788. 旋转数字](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0788.Rotated%20Digits/README.md)
+-   [1012. 至少有 1 位重复的数字](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
+-   [2376. 统计特殊整数](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0900-0999/0927.Three Equal Parts/README.md b/solution/0900-0999/0927.Three Equal Parts/README.md
index 9f7c86e334346..148a06a34a2f6 100644
--- a/solution/0900-0999/0927.Three Equal Parts/README.md	
+++ b/solution/0900-0999/0927.Three Equal Parts/README.md	
@@ -83,7 +83,7 @@
 
 相似题目：
 
--   [1573. 分割字符串的方案数](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md)
+-   [1573. 分割字符串的方案数](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/0900-0999/0940.Distinct Subsequences II/README.md b/solution/0900-0999/0940.Distinct Subsequences II/README.md
index 06f05b9b17028..4a1dbe44db28c 100644
--- a/solution/0900-0999/0940.Distinct Subsequences II/README.md	
+++ b/solution/0900-0999/0940.Distinct Subsequences II/README.md	
@@ -206,7 +206,7 @@ int distinctSubseqII(char* s) {
 
 相似题目：
 
--   [1987. 不同的好子序列数目](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md)
+-   [1987. 不同的好子序列数目](https://github.com/doocs/leetcode/blob/main/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1004.Max Consecutive Ones III/README.md b/solution/1000-1099/1004.Max Consecutive Ones III/README.md
index 56c8ff7820565..eb820dc5749c9 100644
--- a/solution/1000-1099/1004.Max Consecutive Ones III/README.md	
+++ b/solution/1000-1099/1004.Max Consecutive Ones III/README.md	
@@ -44,7 +44,9 @@
 
 时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为数组的长度。
 
-相似题目：[487. 最大连续 1 的个数 II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md)
+相似题目：
+
+-   [487. 最大连续 1 的个数 II](https://github.com/doocs/leetcode/blob/main/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md)
 
 以下是滑动窗口的优化版本。
 
@@ -56,7 +58,9 @@
 -   `r++` 每次都会执行，`l++` 只有资源 `k < 0` 时才触发，因此 `r - l` 的值只会单调递增（或保持不变）
 -   移动左端点时，如果当前元素是 0，说明可以释放一个资源，k 加 1
 
-相似题目： [2024. 考试的最大困扰度](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md)
+相似题目：
+
+-   [2024. 考试的最大困扰度](https://github.com/doocs/leetcode/blob/main/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1012.Numbers With Repeated Digits/README.md b/solution/1000-1099/1012.Numbers With Repeated Digits/README.md
index 480b487f53b8a..0593e3c13e749 100644
--- a/solution/1000-1099/1012.Numbers With Repeated Digits/README.md	
+++ b/solution/1000-1099/1012.Numbers With Repeated Digits/README.md	
@@ -69,12 +69,12 @@
 
 相似题目：
 
--   [233. 数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
--   [357. 统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
--   [600. 不含连续 1 的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
--   [788. 旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md)
--   [902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
--   [2376. 统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
+-   [233. 数字 1 的个数](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
+-   [357. 统计各位数字都不同的数字个数](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
+-   [600. 不含连续 1 的非负整数](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
+-   [788. 旋转数字](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0788.Rotated%20Digits/README.md)
+-   [902. 最大为 N 的数字组合](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
+-   [2376. 统计特殊整数](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2376.Count%20Special%20Integers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1017.Convert to Base -2/README.md b/solution/1000-1099/1017.Convert to Base -2/README.md
index 5d0f55f3b73fd..222f848f52cf3 100644
--- a/solution/1000-1099/1017.Convert to Base -2/README.md	
+++ b/solution/1000-1099/1017.Convert to Base -2/README.md	
@@ -56,7 +56,7 @@
 
 相似题目：
 
--   [1073. 负二进制数相加](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md)
+-   [1073. 负二进制数相加](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1024.Video Stitching/README.md b/solution/1000-1099/1024.Video Stitching/README.md
index 7ad5e370c7abc..619c37cda80fb 100644
--- a/solution/1000-1099/1024.Video Stitching/README.md	
+++ b/solution/1000-1099/1024.Video Stitching/README.md	
@@ -80,9 +80,9 @@
 
 相似题目：
 
--   [45. 跳跃游戏 II](/solution/0000-0099/0045.Jump%20Game%20II/README.md)
--   [55. 跳跃游戏](/solution/0000-0099/0055.Jump%20Game/README.md)
--   [1326. 灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md)
+-   [45. 跳跃游戏 II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0045.Jump%20Game%20II/README.md)
+-   [55. 跳跃游戏](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0055.Jump%20Game/README.md)
+-   [1326. 灌溉花园的最少水龙头数目](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1029.Two City Scheduling/README.md b/solution/1000-1099/1029.Two City Scheduling/README.md
index e3633429f4ce4..a05a0b4a33cf2 100644
--- a/solution/1000-1099/1029.Two City Scheduling/README.md	
+++ b/solution/1000-1099/1029.Two City Scheduling/README.md	
@@ -61,7 +61,7 @@
 
 相似题目：
 
--   [2611. 老鼠和奶酪](/solution/2600-2699/2611.Mice%20and%20Cheese/README.md)
+-   [2611. 老鼠和奶酪](https://github.com/doocs/leetcode/blob/main/solution/2600-2699/2611.Mice%20and%20Cheese/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1039.Minimum Score Triangulation of Polygon/README.md b/solution/1000-1099/1039.Minimum Score Triangulation of Polygon/README.md
index 4389d6240df8f..8ce8f6131de21 100644
--- a/solution/1000-1099/1039.Minimum Score Triangulation of Polygon/README.md	
+++ b/solution/1000-1099/1039.Minimum Score Triangulation of Polygon/README.md	
@@ -222,7 +222,7 @@ $$
 
 相似题目：
 
--   [1312. 让字符串成为回文串的最少插入次数](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md)
+-   [1312. 让字符串成为回文串的最少插入次数](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1044.Longest Duplicate Substring/README.md b/solution/1000-1099/1044.Longest Duplicate Substring/README.md
index 8d233bd8c9d7b..dae40938591c6 100644
--- a/solution/1000-1099/1044.Longest Duplicate Substring/README.md	
+++ b/solution/1000-1099/1044.Longest Duplicate Substring/README.md	
@@ -51,7 +51,9 @@
 
 时间复杂度 $O(n\log n)$。其中 $n$ 为字符串长度。
 
-相似题目：[1062. 最长重复子串](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md)
+相似题目：
+
+-   [1062. 最长重复子串](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1062.Longest Repeating Substring/README.md b/solution/1000-1099/1062.Longest Repeating Substring/README.md
index c54785cd2a4c1..dbad6d59086e2 100644
--- a/solution/1000-1099/1062.Longest Repeating Substring/README.md	
+++ b/solution/1000-1099/1062.Longest Repeating Substring/README.md	
@@ -65,7 +65,9 @@ $$
 
 其中 $n$ 为字符串 $s$ 的长度。
 
-相似题目：[1044. 最长重复子串](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md)
+相似题目：
+
+-   [1044. 最长重复子串](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1065.Index Pairs of a String/README.md b/solution/1000-1099/1065.Index Pairs of a String/README.md
index c6683542ff9d3..e226d3f2b0a0b 100644
--- a/solution/1000-1099/1065.Index Pairs of a String/README.md	
+++ b/solution/1000-1099/1065.Index Pairs of a String/README.md	
@@ -191,8 +191,8 @@ func indexPairs(text string, words []string) [][]int {
 
 相似题目：
 
--   [616. 给字符串添加加粗标签](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md)
--   [758. 字符串中的加粗单词](/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md)
+-   [616. 给字符串添加加粗标签](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md)
+-   [758. 字符串中的加粗单词](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1067.Digit Count in Range/README.md b/solution/1000-1099/1067.Digit Count in Range/README.md
index aa8adf4e5542d..53d438d3dac38 100644
--- a/solution/1000-1099/1067.Digit Count in Range/README.md	
+++ b/solution/1000-1099/1067.Digit Count in Range/README.md	
@@ -65,7 +65,9 @@ $$
 
 时间复杂度 $O(\log m + \log n)$。其中 $m$, $n$ 分别为题目中的 `low` 和 `high`。
 
-相似题目：[233. 数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
+相似题目：
+
+-   [233. 数字 1 的个数](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1072.Flip Columns For Maximum Number of Equal Rows/README.md b/solution/1000-1099/1072.Flip Columns For Maximum Number of Equal Rows/README.md
index d31c7802ffa4d..11e99ad3ac6c9 100644
--- a/solution/1000-1099/1072.Flip Columns For Maximum Number of Equal Rows/README.md	
+++ b/solution/1000-1099/1072.Flip Columns For Maximum Number of Equal Rows/README.md	
@@ -73,7 +73,7 @@
 
 相似题目：
 
--   [2128. 通过翻转行或列来去除所有的 1](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md)
+-   [2128. 通过翻转行或列来去除所有的 1](https://github.com/doocs/leetcode/blob/main/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1000-1099/1073.Adding Two Negabinary Numbers/README.md b/solution/1000-1099/1073.Adding Two Negabinary Numbers/README.md
index 4c995acab3cb1..3cd1fe60c4edd 100644
--- a/solution/1000-1099/1073.Adding Two Negabinary Numbers/README.md	
+++ b/solution/1000-1099/1073.Adding Two Negabinary Numbers/README.md	
@@ -67,7 +67,7 @@
 
 相似题目：
 
--   [1017. 负二进制转换](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md)
+-   [1017. 负二进制转换](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1100-1199/1131.Maximum of Absolute Value Expression/README.md b/solution/1100-1199/1131.Maximum of Absolute Value Expression/README.md
index 4e262ede80042..7f5966c5e7dc6 100644
--- a/solution/1100-1199/1131.Maximum of Absolute Value Expression/README.md	
+++ b/solution/1100-1199/1131.Maximum of Absolute Value Expression/README.md	
@@ -51,7 +51,7 @@ $$
 
 相似题目：
 
--   [1330. 翻转子数组得到最大的数组值](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md)
+-   [1330. 翻转子数组得到最大的数组值](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1100-1199/1131.Maximum of Absolute Value Expression/README_EN.md b/solution/1100-1199/1131.Maximum of Absolute Value Expression/README_EN.md
index b2ce06484f315..8bd0f6f2eb846 100644
--- a/solution/1100-1199/1131.Maximum of Absolute Value Expression/README_EN.md	
+++ b/solution/1100-1199/1131.Maximum of Absolute Value Expression/README_EN.md	
@@ -50,7 +50,7 @@ The time complexity is $O(n)$, where $n$ is the length of the array. The space c
 
 Similar problems:
 
--   [1330. Reverse Subarray To Maximize Array Value](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README_EN.md)
+-   [1330. Reverse Subarray To Maximize Array Value](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1200-1299/1235.Maximum Profit in Job Scheduling/README.md b/solution/1200-1299/1235.Maximum Profit in Job Scheduling/README.md
index 721e4e92a7f66..d5599bdad7a5f 100644
--- a/solution/1200-1299/1235.Maximum Profit in Job Scheduling/README.md	
+++ b/solution/1200-1299/1235.Maximum Profit in Job Scheduling/README.md	
@@ -248,8 +248,8 @@ $$
 
 相似题目：
 
--   [2008. 出租车的最大盈利](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md)
--   [1751. 最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
+-   [2008. 出租车的最大盈利](https://github.com/doocs/leetcode/blob/main/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md)
+-   [1751. 最多可以参加的会议数目 II](https://github.com/doocs/leetcode/blob/main/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1200-1299/1235.Maximum Profit in Job Scheduling/README_EN.md b/solution/1200-1299/1235.Maximum Profit in Job Scheduling/README_EN.md
index 32da60afcfa61..bdfd823988375 100644
--- a/solution/1200-1299/1235.Maximum Profit in Job Scheduling/README_EN.md	
+++ b/solution/1200-1299/1235.Maximum Profit in Job Scheduling/README_EN.md	
@@ -241,8 +241,8 @@ The time complexity is $O(n \times \log n)$, where $n$ is the number of jobs.
 
 Similar problems:
 
--   [2008. Maximum Earnings From Taxi](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md)
--   [1751. Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
+-   [2008. Maximum Earnings From Taxi](https://github.com/doocs/leetcode/blob/main/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md)
+-   [1751. Maximum Number of Events That Can Be Attended II](https://github.com/doocs/leetcode/blob/main/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1200-1299/1245.Tree Diameter/README.md b/solution/1200-1299/1245.Tree Diameter/README.md
index 3953f6d8ea74c..0057417dee076 100644
--- a/solution/1200-1299/1245.Tree Diameter/README.md	
+++ b/solution/1200-1299/1245.Tree Diameter/README.md	
@@ -67,7 +67,7 @@
 
 相似题目：
 
--   [1522. N 叉树的直径](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md)
+-   [1522. N 叉树的直径](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1200-1299/1245.Tree Diameter/README_EN.md b/solution/1200-1299/1245.Tree Diameter/README_EN.md
index 094aa77e45ca8..4b450f28d8bdd 100644
--- a/solution/1200-1299/1245.Tree Diameter/README_EN.md	
+++ b/solution/1200-1299/1245.Tree Diameter/README_EN.md	
@@ -59,7 +59,7 @@ Therefore, the theorem holds.
 
 Similar problems:
 
--   [1522. Diameter of N-Ary Tree](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md)
+-   [1522. Diameter of N-Ary Tree](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1200-1299/1249.Minimum Remove to Make Valid Parentheses/README.md b/solution/1200-1299/1249.Minimum Remove to Make Valid Parentheses/README.md
index b8a17f917d2e3..f05db53e6d1a0 100644
--- a/solution/1200-1299/1249.Minimum Remove to Make Valid Parentheses/README.md	
+++ b/solution/1200-1299/1249.Minimum Remove to Make Valid Parentheses/README.md	
@@ -64,8 +64,8 @@
 
 相似题目：
 
--   [678. 有效的括号字符串](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
--   [2116. 判断一个括号字符串是否有效](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md)
+-   [678. 有效的括号字符串](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
+-   [2116. 判断一个括号字符串是否有效](https://github.com/doocs/leetcode/blob/main/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1200-1299/1249.Minimum Remove to Make Valid Parentheses/README_EN.md b/solution/1200-1299/1249.Minimum Remove to Make Valid Parentheses/README_EN.md
index 766d98ad06153..ea4d476fe8d34 100644
--- a/solution/1200-1299/1249.Minimum Remove to Make Valid Parentheses/README_EN.md	
+++ b/solution/1200-1299/1249.Minimum Remove to Make Valid Parentheses/README_EN.md	
@@ -58,8 +58,8 @@ The time complexity is $O(n)$, and the space complexity is $O(n)$. Where $n$ is
 
 Similar problems:
 
--   [678. Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README_EN.md)
--   [2116. Check if a Parentheses String Can Be Valid](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README_EN.md)
+-   [678. Valid Parenthesis String](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0678.Valid%20Parenthesis%20String/README_EN.md)
+-   [2116. Check if a Parentheses String Can Be Valid](https://github.com/doocs/leetcode/blob/main/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1300-1399/1312.Minimum Insertion Steps to Make a String Palindrome/README.md b/solution/1300-1399/1312.Minimum Insertion Steps to Make a String Palindrome/README.md
index a73650be1864d..adab4a2bb1480 100644
--- a/solution/1300-1399/1312.Minimum Insertion Steps to Make a String Palindrome/README.md	
+++ b/solution/1300-1399/1312.Minimum Insertion Steps to Make a String Palindrome/README.md	
@@ -192,7 +192,7 @@ $$
 
 相似题目：
 
--   [1039. 多边形三角剖分的最低得分](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md)
+-   [1039. 多边形三角剖分的最低得分](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README.md b/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README.md
index f3e079556c7fe..218fbb78ed293 100644
--- a/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README.md	
+++ b/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README.md	
@@ -76,9 +76,9 @@
 
 相似题目：
 
--   [45. 跳跃游戏 II](/solution/0000-0099/0045.Jump%20Game%20II/README.md)
--   [55. 跳跃游戏](/solution/0000-0099/0055.Jump%20Game/README.md)
--   [1024. 视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md)
+-   [45. 跳跃游戏 II](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0045.Jump%20Game%20II/README.md)
+-   [55. 跳跃游戏](https://github.com/doocs/leetcode/blob/main/solution/0000-0099/0055.Jump%20Game/README.md)
+-   [1024. 视频拼接](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1024.Video%20Stitching/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1300-1399/1330.Reverse Subarray To Maximize Array Value/README.md b/solution/1300-1399/1330.Reverse Subarray To Maximize Array Value/README.md
index 9a2464394b9ea..6da4801d82c12 100644
--- a/solution/1300-1399/1330.Reverse Subarray To Maximize Array Value/README.md	
+++ b/solution/1300-1399/1330.Reverse Subarray To Maximize Array Value/README.md	
@@ -83,7 +83,7 @@ $$
 
 相似题目：
 
--   [1131. 绝对值表达式的最大值](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md)
+-   [1131. 绝对值表达式的最大值](https://github.com/doocs/leetcode/blob/main/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1300-1399/1383.Maximum Performance of a Team/README.md b/solution/1300-1399/1383.Maximum Performance of a Team/README.md
index fb4cc18234d96..642bff9f9afef 100644
--- a/solution/1300-1399/1383.Maximum Performance of a Team/README.md	
+++ b/solution/1300-1399/1383.Maximum Performance of a Team/README.md	
@@ -61,7 +61,9 @@
 
 时间复杂度 $O(n\log n)$。
 
-相似题目：[857. 雇佣 K 名工人的最低成本](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md)
+相似题目：
+
+-   [857. 雇佣 K 名工人的最低成本](https://github.com/doocs/leetcode/blob/main/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md b/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md
index 6188b3efef420..7056105fb7eb5 100644
--- a/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md	
+++ b/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md	
@@ -70,7 +70,9 @@ $$
 
 时间复杂度 $O(m \times n \times k \times (m + n))$，空间复杂度 $O(m \times n \times k)$。其中 $m$, $n$ 分别是矩形的行数和列数。
 
-相似题目：[2312. 卖木头块](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README.md)
+相似题目：
+
+-   [2312. 卖木头块](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1400-1499/1483.Kth Ancestor of a Tree Node/README.md b/solution/1400-1499/1483.Kth Ancestor of a Tree Node/README.md
index d48b6fa9fd530..a3c29bb2cfcd1 100644
--- a/solution/1400-1499/1483.Kth Ancestor of a Tree Node/README.md	
+++ b/solution/1400-1499/1483.Kth Ancestor of a Tree Node/README.md	
@@ -73,7 +73,7 @@ $$
 
 相似题目：
 
--   [2836. 在传球游戏中最大化函数值](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README.md)
+-   [2836. 在传球游戏中最大化函数值](https://github.com/doocs/leetcode/blob/main/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1400-1499/1483.Kth Ancestor of a Tree Node/README_EN.md b/solution/1400-1499/1483.Kth Ancestor of a Tree Node/README_EN.md
index 97bfdf19fa7e9..a087dee51c9aa 100644
--- a/solution/1400-1499/1483.Kth Ancestor of a Tree Node/README_EN.md	
+++ b/solution/1400-1499/1483.Kth Ancestor of a Tree Node/README_EN.md	
@@ -65,7 +65,7 @@ In terms of time complexity, the initialization is $O(n \times \log n)$, and the
 
 Similar problems:
 
--   [2836. Maximize Value of Function in a Ball Passing Game](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README_EN.md)
+-   [2836. Maximize Value of Function in a Ball Passing Game](https://github.com/doocs/leetcode/blob/main/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1500-1599/1509.Minimum Difference Between Largest and Smallest Value in Three Moves/README.md b/solution/1500-1599/1509.Minimum Difference Between Largest and Smallest Value in Three Moves/README.md
index b8ddecb0c6998..a726d64d4d9df 100644
--- a/solution/1500-1599/1509.Minimum Difference Between Largest and Smallest Value in Three Moves/README.md	
+++ b/solution/1500-1599/1509.Minimum Difference Between Largest and Smallest Value in Three Moves/README.md	
@@ -70,7 +70,7 @@
 
 相似题目：
 
--   [2567. 修改两个元素的最小分数](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README.md)
+-   [2567. 修改两个元素的最小分数](https://github.com/doocs/leetcode/blob/main/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1500-1599/1513.Number of Substrings With Only 1s/README.md b/solution/1500-1599/1513.Number of Substrings With Only 1s/README.md
index de3973817b133..cb60748f278cf 100644
--- a/solution/1500-1599/1513.Number of Substrings With Only 1s/README.md	
+++ b/solution/1500-1599/1513.Number of Substrings With Only 1s/README.md	
@@ -64,8 +64,8 @@
 
 相似题目：
 
--   [413. 等差数列划分](/solution/0400-0499/0413.Arithmetic%20Slices/README.md)
--   [2348. 全 0 子数组的数目](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README.md)
+-   [413. 等差数列划分](https://github.com/doocs/leetcode/blob/main/solution/0400-0499/0413.Arithmetic%20Slices/README.md)
+-   [2348. 全 0 子数组的数目](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1500-1599/1562.Find Latest Group of Size M/README.md b/solution/1500-1599/1562.Find Latest Group of Size M/README.md
index 96bc3a86f7077..440eca6dbb06a 100644
--- a/solution/1500-1599/1562.Find Latest Group of Size M/README.md	
+++ b/solution/1500-1599/1562.Find Latest Group of Size M/README.md	
@@ -71,9 +71,11 @@
 
 正向遍历 $arr$，利用并查集动态维护每组 $1$ 的长度。
 
-时间复杂度 $O(nlogn)$。
+时间复杂度 $O(n \times \log n)$。
 
-相似题目：[2334. 元素值大于变化阈值的子数组](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README.md)
+相似题目：
+
+-   [2334. 元素值大于变化阈值的子数组](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1500-1599/1573.Number of Ways to Split a String/README.md b/solution/1500-1599/1573.Number of Ways to Split a String/README.md
index afecdf1f846e2..f54a5a9357a43 100644
--- a/solution/1500-1599/1573.Number of Ways to Split a String/README.md	
+++ b/solution/1500-1599/1573.Number of Ways to Split a String/README.md	
@@ -72,7 +72,7 @@
 
 相似题目：
 
--   [927. 三等分](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md)
+-   [927. 三等分](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0927.Three%20Equal%20Parts/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README.md b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README.md
index 20b471f1416c5..979140bdb86f7 100644
--- a/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README.md	
+++ b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README.md	
@@ -234,8 +234,8 @@ $$
 
 相似题目：
 
--   [1235. 规划兼职工作](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md)
--   [2008. 出租车的最大盈利](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md)
+-   [1235. 规划兼职工作](https://github.com/doocs/leetcode/blob/main/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md)
+-   [2008. 出租车的最大盈利](https://github.com/doocs/leetcode/blob/main/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1700-1799/1755.Closest Subsequence Sum/README.md b/solution/1700-1799/1755.Closest Subsequence Sum/README.md
index 3dfae480ea2fe..9b8f92a95fa10 100644
--- a/solution/1700-1799/1755.Closest Subsequence Sum/README.md	
+++ b/solution/1700-1799/1755.Closest Subsequence Sum/README.md	
@@ -58,7 +58,9 @@
 
 时间复杂度 $O(n\times 2^{n/2})$。
 
-相似题目：[1774. 最接近目标价格的甜点成本](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md)
+相似题目：
+
+-   [1774. 最接近目标价格的甜点成本](https://github.com/doocs/leetcode/blob/main/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1700-1799/1774.Closest Dessert Cost/README.md b/solution/1700-1799/1774.Closest Dessert Cost/README.md
index 880855fd29193..dcd08d8197ed1 100644
--- a/solution/1700-1799/1774.Closest Dessert Cost/README.md	
+++ b/solution/1700-1799/1774.Closest Dessert Cost/README.md	
@@ -88,7 +88,9 @@
 
 时间复杂度 $O(n \times 2^m \times \log {2^m})$。
 
-相似题目：[1755. 最接近目标值的子序列和](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md)
+相似题目：
+
+-   [1755. 最接近目标值的子序列和](https://github.com/doocs/leetcode/blob/main/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README.md b/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README.md
index 733b2aefbad55..9d6a57fa6f0f8 100644
--- a/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README.md	
+++ b/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README.md	
@@ -98,7 +98,7 @@ The robot is initially standing on cell (1, 0), denoted by the -1.
 
 相似题目：
 
--   [1810. 隐藏网格下的最小消耗路径](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README.md)
+-   [1810. 隐藏网格下的最小消耗路径](https://github.com/doocs/leetcode/blob/main/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README_EN.md b/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README_EN.md
index 2261565c57087..0c1d03d9a0550 100644
--- a/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README_EN.md	
+++ b/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README_EN.md	
@@ -96,7 +96,7 @@ The time complexity is $O(m \times n)$, and the space complexity is $O(m \times
 
 Similar problems:
 
--   [1810. Minimum Path Cost in a Hidden Grid](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README_EN.md)
+-   [1810. Minimum Path Cost in a Hidden Grid](https://github.com/doocs/leetcode/blob/main/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1800-1899/1882.Process Tasks Using Servers/README.md b/solution/1800-1899/1882.Process Tasks Using Servers/README.md
index 85348959232d3..0aab19bbeaa65 100644
--- a/solution/1800-1899/1882.Process Tasks Using Servers/README.md	
+++ b/solution/1800-1899/1882.Process Tasks Using Servers/README.md	
@@ -70,7 +70,9 @@
 -   若当前有空闲服务器，那么在空闲队列 `idle` 中取出权重最小的服务器，将其加入使用中的队列 `busy` 中；
 -   若当前没有空闲服务器，那么在使用队列 `busy` 中找出最早结束时间且权重最小的服务器，重新加入使用中的队列 `busy` 中。
 
-相似题目：[2402. 会议室 III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README.md)
+相似题目：
+
+-   [2402. 会议室 III](https://github.com/doocs/leetcode/blob/main/solution/2400-2499/2402.Meeting%20Rooms%20III/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1900-1999/1915.Number of Wonderful Substrings/README.md b/solution/1900-1999/1915.Number of Wonderful Substrings/README.md
index 288595636700f..566188fa54514 100644
--- a/solution/1900-1999/1915.Number of Wonderful Substrings/README.md	
+++ b/solution/1900-1999/1915.Number of Wonderful Substrings/README.md	
@@ -80,7 +80,7 @@
 
 相似题目：
 
--   [1371. 每个元音包含偶数次的最长子字符串](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md)
+-   [1371. 每个元音包含偶数次的最长子字符串](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1900-1999/1944.Number of Visible People in a Queue/README.md b/solution/1900-1999/1944.Number of Visible People in a Queue/README.md
index 32a3d0c1afeca..4774942fa5d0c 100644
--- a/solution/1900-1999/1944.Number of Visible People in a Queue/README.md	
+++ b/solution/1900-1999/1944.Number of Visible People in a Queue/README.md	
@@ -66,7 +66,7 @@
 
 相似题目：
 
--   [2282. 在一个网格中可以看到的人数](/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README.md)
+-   [2282. 在一个网格中可以看到的人数](https://github.com/doocs/leetcode/blob/main/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1900-1999/1987.Number of Unique Good Subsequences/README.md b/solution/1900-1999/1987.Number of Unique Good Subsequences/README.md
index 1c10594c43453..f20370ec2cfa5 100644
--- a/solution/1900-1999/1987.Number of Unique Good Subsequences/README.md	
+++ b/solution/1900-1999/1987.Number of Unique Good Subsequences/README.md	
@@ -69,7 +69,7 @@
 
 相似题目：
 
--   [940. 不同的子序列 II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md)
+-   [940. 不同的子序列 II](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1900-1999/1991.Find the Middle Index in Array/README.md b/solution/1900-1999/1991.Find the Middle Index in Array/README.md
index b0011be588581..40676efc78031 100644
--- a/solution/1900-1999/1991.Find the Middle Index in Array/README.md	
+++ b/solution/1900-1999/1991.Find the Middle Index in Array/README.md	
@@ -82,8 +82,8 @@
 
 相似题目：
 
--   [0724. 寻找数组的中心下标](/solution/0700-0799/0724.Find%20Pivot%20Index/README.md)
--   [2574. 左右元素和的差值](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md)
+-   [0724. 寻找数组的中心下标](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0724.Find%20Pivot%20Index/README.md)
+-   [2574. 左右元素和的差值](https://github.com/doocs/leetcode/blob/main/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/1900-1999/1994.The Number of Good Subsets/README.md b/solution/1900-1999/1994.The Number of Good Subsets/README.md
index aa038633cd294..1a067dd20927e 100644
--- a/solution/1900-1999/1994.The Number of Good Subsets/README.md	
+++ b/solution/1900-1999/1994.The Number of Good Subsets/README.md	
@@ -79,7 +79,7 @@
 
 相似题目：
 
--   [2572. 无平方子集计数](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README.md)
+-   [2572. 无平方子集计数](https://github.com/doocs/leetcode/blob/main/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README.md b/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README.md
index 342219924ad00..1a37464da33a3 100644
--- a/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README.md	
+++ b/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README.md	
@@ -94,7 +94,7 @@ Candidates table:
 
 相似题目：
 
--   [2010. 职员招聘人数 II](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md)
+-   [2010. 职员招聘人数 II](https://github.com/doocs/leetcode/blob/main/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2000-2099/2008.Maximum Earnings From Taxi/README.md b/solution/2000-2099/2008.Maximum Earnings From Taxi/README.md
index 1dbec4161aa2a..a872e0e0b0fc4 100644
--- a/solution/2000-2099/2008.Maximum Earnings From Taxi/README.md	
+++ b/solution/2000-2099/2008.Maximum Earnings From Taxi/README.md	
@@ -224,8 +224,8 @@ $$
 
 相似题目：
 
--   [1235. 规划兼职工作](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md)
--   [1751. 最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
+-   [1235. 规划兼职工作](https://github.com/doocs/leetcode/blob/main/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md)
+-   [1751. 最多可以参加的会议数目 II](https://github.com/doocs/leetcode/blob/main/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2000-2099/2008.Maximum Earnings From Taxi/README_EN.md b/solution/2000-2099/2008.Maximum Earnings From Taxi/README_EN.md
index 50e07ac1e6247..bbab560a3dc86 100644
--- a/solution/2000-2099/2008.Maximum Earnings From Taxi/README_EN.md	
+++ b/solution/2000-2099/2008.Maximum Earnings From Taxi/README_EN.md	
@@ -222,8 +222,8 @@ The time complexity is $O(m \times \log m)$, and the space complexity is $O(m)$.
 
 Similar problems:
 
--   [1235. Maximum Profit in Job Scheduling](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README_EN.md)
--   [1751. Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md)
+-   [1235. Maximum Profit in Job Scheduling](https://github.com/doocs/leetcode/blob/main/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README_EN.md)
+-   [1751. Maximum Number of Events That Can Be Attended II](https://github.com/doocs/leetcode/blob/main/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README.md b/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README.md
index d46293bb4b8bc..89f8f018f492f 100644
--- a/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README.md	
+++ b/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README.md	
@@ -99,7 +99,7 @@ Candidates table:
 
 相似题目：
 
--   [2004. 职员招聘人数](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README.md)
+-   [2004. 职员招聘人数](https://github.com/doocs/leetcode/blob/main/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2100-2199/2104.Sum of Subarray Ranges/README.md b/solution/2100-2199/2104.Sum of Subarray Ranges/README.md
index 200da2cd69e64..9bbbdfcf4679a 100644
--- a/solution/2100-2199/2104.Sum of Subarray Ranges/README.md	
+++ b/solution/2100-2199/2104.Sum of Subarray Ranges/README.md	
@@ -190,7 +190,9 @@ impl Solution {
 
 时间复杂度 $O(n)$。
 
-相似题目：[907. 子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md)
+相似题目：
+
+-   [907. 子数组的最小值之和](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2100-2199/2116.Check if a Parentheses String Can Be Valid/README.md b/solution/2100-2199/2116.Check if a Parentheses String Can Be Valid/README.md
index 218dc9522da1b..c6b3fd50e4863 100644
--- a/solution/2100-2199/2116.Check if a Parentheses String Can Be Valid/README.md	
+++ b/solution/2100-2199/2116.Check if a Parentheses String Can Be Valid/README.md	
@@ -79,7 +79,9 @@
 
 时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为字符串 $s$ 的长度。
 
-相似题目：[678. 有效的括号字符串](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
+相似题目：
+
+-   [678. 有效的括号字符串](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2100-2199/2127.Maximum Employees to Be Invited to a Meeting/README.md b/solution/2100-2199/2127.Maximum Employees to Be Invited to a Meeting/README.md
index 1d0b24cf464f3..fe12af8becf12 100644
--- a/solution/2100-2199/2127.Maximum Employees to Be Invited to a Meeting/README.md	
+++ b/solution/2100-2199/2127.Maximum Employees to Be Invited to a Meeting/README.md	
@@ -85,7 +85,9 @@
 
 时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 为数组 `favorite` 的长度。
 
-相似题目：[2360. 图中的最长环](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README.md)
+相似题目：
+
+-   [2360. 图中的最长环](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README.md b/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README.md
index b3ffb5f9e9e93..a5b459146747c 100644
--- a/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README.md	
+++ b/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README.md	
@@ -70,7 +70,7 @@
 
 相似题目：
 
--   [1072. 按列翻转得到最大值等行数](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md)
+-   [1072. 按列翻转得到最大值等行数](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README.md b/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README.md
index ac1ff8d73cfef..de90e869493d6 100644
--- a/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README.md	
+++ b/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README.md	
@@ -81,7 +81,7 @@
 
 相似题目：
 
--   [2603. 收集树中金币](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README.md)
+-   [2603. 收集树中金币](https://github.com/doocs/leetcode/blob/main/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README_EN.md b/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README_EN.md
index 5c7a8c2cb602e..98839484e2e8b 100644
--- a/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README_EN.md	
+++ b/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README_EN.md	
@@ -79,7 +79,7 @@ The time complexity is $O(n)$, and the space complexity is $O(n)$. Here, $n$ is
 
 Similar problems:
 
--   [2603. Collect Coins in a Tree](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README_EN.md)
+-   [2603. Collect Coins in a Tree](https://github.com/doocs/leetcode/blob/main/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2200-2299/2281.Sum of Total Strength of Wizards/README.md b/solution/2200-2299/2281.Sum of Total Strength of Wizards/README.md
index 47f776f3e89fb..b426f08177c9a 100644
--- a/solution/2200-2299/2281.Sum of Total Strength of Wizards/README.md	
+++ b/solution/2200-2299/2281.Sum of Total Strength of Wizards/README.md	
@@ -66,7 +66,9 @@
 
 ### 方法一：单调栈 + 前缀和
 
-相似题目：[907. 子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md)
+相似题目：
+
+-   [907. 子数组的最小值之和](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README.md b/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README.md
index f35dc8ce89168..2cd2f5e6acd56 100644
--- a/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README.md	
+++ b/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README.md	
@@ -75,7 +75,7 @@
 
 相似题目：
 
--   [1944. 队列中可以看到的人数](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md)
+-   [1944. 队列中可以看到的人数](https://github.com/doocs/leetcode/blob/main/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2200-2299/2290.Minimum Obstacle Removal to Reach Corner/README.md b/solution/2200-2299/2290.Minimum Obstacle Removal to Reach Corner/README.md
index 32e586b7a1408..00bbb45fbb704 100644
--- a/solution/2200-2299/2290.Minimum Obstacle Removal to Reach Corner/README.md	
+++ b/solution/2200-2299/2290.Minimum Obstacle Removal to Reach Corner/README.md	
@@ -66,7 +66,9 @@
 
 时间复杂度 $O(m \times n)$，空间复杂度 $O(m \times n)$。其中 $m$ 和 $n$ 分别是网格的行数和列数。
 
-相似题目：[1368. 使网格图至少有一条有效路径的最小代价](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md)
+相似题目：
+
+-   [1368. 使网格图至少有一条有效路径的最小代价](https://github.com/doocs/leetcode/blob/main/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2307.Check for Contradictions in Equations/README.md b/solution/2300-2399/2307.Check for Contradictions in Equations/README.md
index 4132e97c4bade..969ecc8053e1f 100644
--- a/solution/2300-2399/2307.Check for Contradictions in Equations/README.md	
+++ b/solution/2300-2399/2307.Check for Contradictions in Equations/README.md	
@@ -65,7 +65,7 @@ a = 3, b = 1 和 c = 2.
 
 相似题目：
 
--   [399. 除法求值](/solution/0300-0399/0399.Evaluate%20Division/README.md)
+-   [399. 除法求值](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0399.Evaluate%20Division/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2307.Check for Contradictions in Equations/README_EN.md b/solution/2300-2399/2307.Check for Contradictions in Equations/README_EN.md
index 57244fa85cc70..965fb06fc3e5d 100644
--- a/solution/2300-2399/2307.Check for Contradictions in Equations/README_EN.md	
+++ b/solution/2300-2399/2307.Check for Contradictions in Equations/README_EN.md	
@@ -61,7 +61,7 @@ The time complexity is $O(n \times \log n)$ or $O(n \times \alpha(n))$, and the
 
 Similar problems:
 
--   [399. Evaluate Division](/solution/0300-0399/0399.Evaluate%20Division/README_EN.md)
+-   [399. Evaluate Division](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0399.Evaluate%20Division/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2312.Selling Pieces of Wood/README.md b/solution/2300-2399/2312.Selling Pieces of Wood/README.md
index e99ed3e8cda75..94eb5c422e583 100644
--- a/solution/2300-2399/2312.Selling Pieces of Wood/README.md	
+++ b/solution/2300-2399/2312.Selling Pieces of Wood/README.md	
@@ -189,7 +189,9 @@ func sellingWood(m int, n int, prices [][]int) int64 {
 
 时间复杂度 $O(mn(m+n))$。
 
-相似题目：[1444. 切披萨的方案数](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md)
+相似题目：
+
+-   [1444. 切披萨的方案数](https://github.com/doocs/leetcode/blob/main/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2328.Number of Increasing Paths in a Grid/README.md b/solution/2300-2399/2328.Number of Increasing Paths in a Grid/README.md
index 9a92daba11c62..a9c1e783a8b56 100644
--- a/solution/2300-2399/2328.Number of Increasing Paths in a Grid/README.md	
+++ b/solution/2300-2399/2328.Number of Increasing Paths in a Grid/README.md	
@@ -66,7 +66,9 @@
 
 时间复杂度 $O(m \times n)$，空间复杂度 $O(m \times n)$。其中 $m$ 和 $n$ 分别是网格图的行数和列数。
 
-相似题目：[329. 矩阵中的最长递增路径](/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md)。
+相似题目：
+
+-   [329. 矩阵中的最长递增路径](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md)。
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2334.Subarray With Elements Greater Than Varying Threshold/README.md b/solution/2300-2399/2334.Subarray With Elements Greater Than Varying Threshold/README.md
index 28e8a460fb116..04479cee1fbfa 100644
--- a/solution/2300-2399/2334.Subarray With Elements Greater Than Varying Threshold/README.md	
+++ b/solution/2300-2399/2334.Subarray With Elements Greater Than Varying Threshold/README.md	
@@ -58,7 +58,9 @@ $v$ 作为当前连通块的最小值，当前连通块的大小为 $size[find(i
 
 时间复杂度 $O(nlogn)$。
 
-相似题目：[1562. 查找大小为 M 的最新分组](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md)
+相似题目：
+
+-   [1562. 查找大小为 M 的最新分组](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2337.Move Pieces to Obtain a String/README.md b/solution/2300-2399/2337.Move Pieces to Obtain a String/README.md
index 20dc8253e71e8..2cc9f59672631 100644
--- a/solution/2300-2399/2337.Move Pieces to Obtain a String/README.md	
+++ b/solution/2300-2399/2337.Move Pieces to Obtain a String/README.md	
@@ -70,7 +70,9 @@
 
 时间复杂度 $O(n)$，其中 $n$ 表示字符串 `start` 或 `target` 的长度。
 
-相似题目：[777. 在 LR 字符串中交换相邻字符](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md)
+相似题目：
+
+-   [777. 在 LR 字符串中交换相邻字符](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2348.Number of Zero-Filled Subarrays/README.md b/solution/2300-2399/2348.Number of Zero-Filled Subarrays/README.md
index 69ddc3db6b3ad..849f0ff0f99de 100644
--- a/solution/2300-2399/2348.Number of Zero-Filled Subarrays/README.md	
+++ b/solution/2300-2399/2348.Number of Zero-Filled Subarrays/README.md	
@@ -60,8 +60,8 @@
 
 相似题目：
 
--   [413. 等差数列划分](/solution/0400-0499/0413.Arithmetic%20Slices/README.md)
--   [1513. 仅含 1 的子串数](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md)
+-   [413. 等差数列划分](https://github.com/doocs/leetcode/blob/main/solution/0400-0499/0413.Arithmetic%20Slices/README.md)
+-   [1513. 仅含 1 的子串数](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2359.Find Closest Node to Given Two Nodes/README.md b/solution/2300-2399/2359.Find Closest Node to Given Two Nodes/README.md
index 3c65fb7eab748..64dc71c4413c0 100644
--- a/solution/2300-2399/2359.Find Closest Node to Given Two Nodes/README.md	
+++ b/solution/2300-2399/2359.Find Closest Node to Given Two Nodes/README.md	
@@ -58,7 +58,9 @@
 
 时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 为节点个数。
 
-相似题目：[2203.得到要求路径的最小带权子图](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md)
+相似题目：
+
+-   [2203.得到要求路径的最小带权子图](https://github.com/doocs/leetcode/blob/main/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2360.Longest Cycle in a Graph/README.md b/solution/2300-2399/2360.Longest Cycle in a Graph/README.md
index 01c78c20f1e0a..bfca6856a2ff9 100644
--- a/solution/2300-2399/2360.Longest Cycle in a Graph/README.md	
+++ b/solution/2300-2399/2360.Longest Cycle in a Graph/README.md	
@@ -56,7 +56,9 @@
 
 时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 为节点数。
 
-相似题目：[2127. 参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md)
+相似题目：
+
+-   [2127. 参加会议的最多员工数](https://github.com/doocs/leetcode/blob/main/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2376.Count Special Integers/README.md b/solution/2300-2399/2376.Count Special Integers/README.md
index c4a6b01fb18a7..341f321370727 100644
--- a/solution/2300-2399/2376.Count Special Integers/README.md	
+++ b/solution/2300-2399/2376.Count Special Integers/README.md	
@@ -66,12 +66,12 @@ $$
 
 相似题目：
 
--   [233. 数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
--   [357. 统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
--   [600. 不含连续 1 的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
--   [788. 旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md)
--   [902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
--   [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
+-   [233. 数字 1 的个数](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
+-   [357. 统计各位数字都不同的数字个数](https://github.com/doocs/leetcode/blob/main/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
+-   [600. 不含连续 1 的非负整数](https://github.com/doocs/leetcode/blob/main/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
+-   [788. 旋转数字](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0788.Rotated%20Digits/README.md)
+-   [902. 最大为 N 的数字组合](https://github.com/doocs/leetcode/blob/main/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
+-   [1012. 至少有 1 位重复的数字](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2300-2399/2382.Maximum Segment Sum After Removals/README.md b/solution/2300-2399/2382.Maximum Segment Sum After Removals/README.md
index 3f6576400ea92..4f970641811ce 100644
--- a/solution/2300-2399/2382.Maximum Segment Sum After Removals/README.md	
+++ b/solution/2300-2399/2382.Maximum Segment Sum After Removals/README.md	
@@ -64,7 +64,9 @@
 
 时间复杂度 $O(nlogn)$。其中 $n$ 是 $nums$ 中的元素个数。
 
-相似题目：[2334. 元素值大于变化阈值的子数组](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README.md)
+相似题目：
+
+-   [2334. 元素值大于变化阈值的子数组](https://github.com/doocs/leetcode/blob/main/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2400-2499/2402.Meeting Rooms III/README.md b/solution/2400-2499/2402.Meeting Rooms III/README.md
index cc0eab6d62840..32b954bfc0c1b 100644
--- a/solution/2400-2499/2402.Meeting Rooms III/README.md	
+++ b/solution/2400-2499/2402.Meeting Rooms III/README.md	
@@ -81,7 +81,7 @@
 
 相似题目：
 
--   [1882. 使用服务器处理任务](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md)
+-   [1882. 使用服务器处理任务](https://github.com/doocs/leetcode/blob/main/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2400-2499/2402.Meeting Rooms III/README_EN.md b/solution/2400-2499/2402.Meeting Rooms III/README_EN.md
index 63268fbc47299..e81abb447f0d1 100644
--- a/solution/2400-2499/2402.Meeting Rooms III/README_EN.md	
+++ b/solution/2400-2499/2402.Meeting Rooms III/README_EN.md	
@@ -79,7 +79,7 @@ The time complexity is $O(m \times \log m)$, where $m$ is the number of meetings
 
 Similar problems:
 
--   [1882. Process Tasks Using Servers](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README_EN.md)
+-   [1882. Process Tasks Using Servers](https://github.com/doocs/leetcode/blob/main/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README.md b/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README.md
index aa277d5483897..7c46fa3f3c7b6 100644
--- a/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README.md	
+++ b/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README.md	
@@ -239,8 +239,8 @@ impl Solution {
 
 相似题目：
 
--   [296. 最佳的碰头地点](/solution/0200-0299/0296.Best%20Meeting%20Point/README.md)
--   [462. 最少移动次数使数组元素相等 II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md)
+-   [296. 最佳的碰头地点](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0296.Best%20Meeting%20Point/README.md)
+-   [462. 最少移动次数使数组元素相等 II](https://github.com/doocs/leetcode/blob/main/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README_EN.md b/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README_EN.md
index 65120794bdbba..55833c3b0c597 100644
--- a/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README_EN.md	
+++ b/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README_EN.md	
@@ -235,8 +235,8 @@ The time complexity is $O(n\times \log n)$, where $n$ is the length of the array
 
 Similar problems:
 
--   [296. Best Meeting Point](/solution/0200-0299/0296.Best%20Meeting%20Point/README_EN.md)
--   [462. Minimum Moves to Equal Array Elements II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README_EN.md)
+-   [296. Best Meeting Point](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0296.Best%20Meeting%20Point/README_EN.md)
+-   [462. Minimum Moves to Equal Array Elements II](https://github.com/doocs/leetcode/blob/main/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/README.md b/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/README.md
index 74b8a5634f144..9270beeebc151 100644
--- a/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/README.md	
+++ b/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/README.md	
@@ -214,7 +214,7 @@ int maxCount(int* banned, int bannedSize, int n, int maxSum) {
 
 相似题目：
 
--   [2557. 从一个范围内选择最多整数 II](/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README.md)
+-   [2557. 从一个范围内选择最多整数 II](https://github.com/doocs/leetcode/blob/main/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/README_EN.md b/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/README_EN.md
index fb41931dfc242..704f4ecc552a3 100644
--- a/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/README_EN.md	
+++ b/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/README_EN.md	
@@ -213,7 +213,7 @@ The time complexity is $O(n \times \log n)$, and the space complexity is $O(n)$.
 
 Similar problems:
 
--   [2557. Maximum Number of Integers to Choose From a Range II](/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README.md)
+-   [2557. Maximum Number of Integers to Choose From a Range II](https://github.com/doocs/leetcode/blob/main/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README.md b/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README.md
index aa631ea08537f..dc1a7b971cb6d 100644
--- a/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README.md	
+++ b/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README.md	
@@ -69,7 +69,7 @@
 
 相似题目：
 
--   [1509. 三次操作后最大值与最小值的最小差](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md)
+-   [1509. 三次操作后最大值与最小值的最小差](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README_EN.md b/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README_EN.md
index c02a16ab38f48..f5c044c20d869 100644
--- a/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README_EN.md	
+++ b/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README_EN.md	
@@ -63,7 +63,7 @@ The time complexity is $O(n \log n)$, and the space complexity is $O(\log n)$. H
 
 Similar problems:
 
--[1509. Minimum Difference Between Largest and Smallest Value in Three Moves](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README_EN.md)
+-[1509. Minimum Difference Between Largest and Smallest Value in Three Moves](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2500-2599/2572.Count the Number of Square-Free Subsets/README.md b/solution/2500-2599/2572.Count the Number of Square-Free Subsets/README.md
index 8fdea74406e86..aff74125e2e4c 100644
--- a/solution/2500-2599/2572.Count the Number of Square-Free Subsets/README.md	
+++ b/solution/2500-2599/2572.Count the Number of Square-Free Subsets/README.md	
@@ -65,7 +65,7 @@
 
 相似题目：
 
--   [1994. 好子集的数目](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md)
+-   [1994. 好子集的数目](https://github.com/doocs/leetcode/blob/main/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2500-2599/2572.Count the Number of Square-Free Subsets/README_EN.md b/solution/2500-2599/2572.Count the Number of Square-Free Subsets/README_EN.md
index aefedd4988e0f..984799f412183 100644
--- a/solution/2500-2599/2572.Count the Number of Square-Free Subsets/README_EN.md	
+++ b/solution/2500-2599/2572.Count the Number of Square-Free Subsets/README_EN.md	
@@ -62,7 +62,7 @@ The time complexity is $O(n + C \times M)$, and the space complexity is $O(M)$.
 
 Similar problems:
 
--   [1994. The Number of Good Subsets](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README_EN.md)
+-   [1994. The Number of Good Subsets](https://github.com/doocs/leetcode/blob/main/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2500-2599/2574.Left and Right Sum Differences/README.md b/solution/2500-2599/2574.Left and Right Sum Differences/README.md
index 170ae7786b748..56f05fc80aeb5 100644
--- a/solution/2500-2599/2574.Left and Right Sum Differences/README.md	
+++ b/solution/2500-2599/2574.Left and Right Sum Differences/README.md	
@@ -63,8 +63,8 @@
 
 相似题目：
 
--   [0724. 寻找数组的中心下标](/solution/0700-0799/0724.Find%20Pivot%20Index/README.md)
--   [1991. 找到数组的中间位置](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md)
+-   [0724. 寻找数组的中心下标](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0724.Find%20Pivot%20Index/README.md)
+-   [1991. 找到数组的中间位置](https://github.com/doocs/leetcode/blob/main/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2500-2599/2574.Left and Right Sum Differences/README_EN.md b/solution/2500-2599/2574.Left and Right Sum Differences/README_EN.md
index a60e58660c40b..bd89533998cc7 100644
--- a/solution/2500-2599/2574.Left and Right Sum Differences/README_EN.md	
+++ b/solution/2500-2599/2574.Left and Right Sum Differences/README_EN.md	
@@ -61,8 +61,8 @@ The time complexity is $O(n)$, and the space complexity is $O(1)$. Where $n$ is
 
 Similar problems:
 
--   [0724. Find Pivot Index](/solution/0700-0799/0724.Find%20Pivot%20Index/README_EN.md)
--   [1991. Find the Middle Index in Array](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README_EN.md)
+-   [0724. Find Pivot Index](https://github.com/doocs/leetcode/blob/main/solution/0700-0799/0724.Find%20Pivot%20Index/README_EN.md)
+-   [1991. Find the Middle Index in Array](https://github.com/doocs/leetcode/blob/main/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2500-2599/2581.Count Number of Possible Root Nodes/README.md b/solution/2500-2599/2581.Count Number of Possible Root Nodes/README.md
index 24c4262c25074..0ed2a309dfb73 100644
--- a/solution/2500-2599/2581.Count Number of Possible Root Nodes/README.md	
+++ b/solution/2500-2599/2581.Count Number of Possible Root Nodes/README.md	
@@ -90,7 +90,7 @@
 
 相似题目：
 
--   [834. 树中距离之和](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md)
+-   [834. 树中距离之和](https://github.com/doocs/leetcode/blob/main/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2600-2699/2603.Collect Coins in a Tree/README.md b/solution/2600-2699/2603.Collect Coins in a Tree/README.md
index 118926386f9ba..d5ea9d365298c 100644
--- a/solution/2600-2699/2603.Collect Coins in a Tree/README.md	
+++ b/solution/2600-2699/2603.Collect Coins in a Tree/README.md	
@@ -72,7 +72,7 @@
 
 相似题目：
 
--   [2204. 无向图中到环的距离](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README.md)
+-   [2204. 无向图中到环的距离](https://github.com/doocs/leetcode/blob/main/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2600-2699/2603.Collect Coins in a Tree/README_EN.md b/solution/2600-2699/2603.Collect Coins in a Tree/README_EN.md
index 8a8020ce68555..0e3d02b53da5a 100644
--- a/solution/2600-2699/2603.Collect Coins in a Tree/README_EN.md	
+++ b/solution/2600-2699/2603.Collect Coins in a Tree/README_EN.md	
@@ -66,7 +66,7 @@ The time complexity is $O(n)$ and the space complexity is $O(n)$, where $n$ is t
 
 Similar problems:
 
--   [2204. Distance to a Cycle in Undirected Graph](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README_EN.md)
+-   [2204. Distance to a Cycle in Undirected Graph](https://github.com/doocs/leetcode/blob/main/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2600-2699/2611.Mice and Cheese/README.md b/solution/2600-2699/2611.Mice and Cheese/README.md
index 1823e091a687b..aa5ba60bcd04d 100644
--- a/solution/2600-2699/2611.Mice and Cheese/README.md	
+++ b/solution/2600-2699/2611.Mice and Cheese/README.md	
@@ -65,7 +65,7 @@
 
 相似题目：
 
--   [1029. 两地调度](/solution/1000-1099/1029.Two%20City%20Scheduling/README.md)
+-   [1029. 两地调度](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1029.Two%20City%20Scheduling/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2700-2799/2719.Count of Integers/README.md b/solution/2700-2799/2719.Count of Integers/README.md
index a44ffa3d4e8ee..ef840c53c40b8 100644
--- a/solution/2700-2799/2719.Count of Integers/README.md	
+++ b/solution/2700-2799/2719.Count of Integers/README.md	
@@ -58,7 +58,7 @@
 
 相似题目：
 
--   [2801. 统计范围内的步进数字数目](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README.md)
+-   [2801. 统计范围内的步进数字数目](https://github.com/doocs/leetcode/blob/main/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2700-2799/2719.Count of Integers/README_EN.md b/solution/2700-2799/2719.Count of Integers/README_EN.md
index 1765eaceae95b..233645e4b1d87 100644
--- a/solution/2700-2799/2719.Count of Integers/README_EN.md	
+++ b/solution/2700-2799/2719.Count of Integers/README_EN.md	
@@ -54,7 +54,7 @@ The time complexity is $O(10 \times n \times max\_sum)$, and the space complexit
 
 Similar problems:
 
--   [2801. Count Stepping Numbers in Range](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README_EN.md)
+-   [2801. Count Stepping Numbers in Range](https://github.com/doocs/leetcode/blob/main/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2700-2799/2728.Count Houses in a Circular Street/README.md b/solution/2700-2799/2728.Count Houses in a Circular Street/README.md
index 834ca57dd1571..a1b0c68959e8a 100644
--- a/solution/2700-2799/2728.Count Houses in a Circular Street/README.md	
+++ b/solution/2700-2799/2728.Count Houses in a Circular Street/README.md	
@@ -61,7 +61,7 @@
 
 相似题目：
 
--   [2753. 计算一个环形街道上的房屋数量 II](/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README.md)
+-   [2753. 计算一个环形街道上的房屋数量 II](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2700-2799/2736.Maximum Sum Queries/README.md b/solution/2700-2799/2736.Maximum Sum Queries/README.md
index 47a925acca564..44085ad5455f5 100644
--- a/solution/2700-2799/2736.Maximum Sum Queries/README.md	
+++ b/solution/2700-2799/2736.Maximum Sum Queries/README.md	
@@ -77,7 +77,7 @@ $$
 
 相似题目：
 
--   [2940. 找到 Alice 和 Bob 可以相遇的建筑](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README.md)
+-   [2940. 找到 Alice 和 Bob 可以相遇的建筑](https://github.com/doocs/leetcode/blob/main/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2700-2799/2736.Maximum Sum Queries/README_EN.md b/solution/2700-2799/2736.Maximum Sum Queries/README_EN.md
index 8f6eecd669635..55f0f4251d4d9 100644
--- a/solution/2700-2799/2736.Maximum Sum Queries/README_EN.md	
+++ b/solution/2700-2799/2736.Maximum Sum Queries/README_EN.md	
@@ -79,7 +79,7 @@ The time complexity is $O((n + m) \times \log n + m \times \log m)$, and the spa
 
 Similar problems:
 
--   [2940. Find Building Where Alice and Bob Can Meet](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README_EN.md)
+-   [2940. Find Building Where Alice and Bob Can Meet](https://github.com/doocs/leetcode/blob/main/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2700-2799/2753.Count Houses in a Circular Street II/README.md b/solution/2700-2799/2753.Count Houses in a Circular Street II/README.md
index 2dd8df3686327..78a646fa6c534 100644
--- a/solution/2700-2799/2753.Count Houses in a Circular Street II/README.md	
+++ b/solution/2700-2799/2753.Count Houses in a Circular Street II/README.md	
@@ -64,7 +64,7 @@
 
 相似题目：
 
--   [2728. 计算一个环形街道上的房屋数量](/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README.md)
+-   [2728. 计算一个环形街道上的房屋数量](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2801.Count Stepping Numbers in Range/README.md b/solution/2800-2899/2801.Count Stepping Numbers in Range/README.md
index 06ac184d09409..cf1e82ec1b510 100644
--- a/solution/2800-2899/2801.Count Stepping Numbers in Range/README.md	
+++ b/solution/2800-2899/2801.Count Stepping Numbers in Range/README.md	
@@ -66,7 +66,7 @@
 
 相似题目：
 
--   [2719. 统计整数数目](/solution/2700-2799/2719.Count%20of%20Integers/README.md)
+-   [2719. 统计整数数目](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2719.Count%20of%20Integers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2801.Count Stepping Numbers in Range/README_EN.md b/solution/2800-2899/2801.Count Stepping Numbers in Range/README_EN.md
index 0d8530712f079..609ce65598807 100644
--- a/solution/2800-2899/2801.Count Stepping Numbers in Range/README_EN.md	
+++ b/solution/2800-2899/2801.Count Stepping Numbers in Range/README_EN.md	
@@ -64,7 +64,7 @@ The time complexity is $O(\log M \times |\Sigma|^2)$, and the space complexity i
 
 Similar problems:
 
--   [2719. Count of Integers](/solution/2700-2799/2719.Count%20of%20Integers/README_EN.md)
+-   [2719. Count of Integers](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2719.Count%20of%20Integers/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2827.Number of Beautiful Integers in the Range/README.md b/solution/2800-2899/2827.Number of Beautiful Integers in the Range/README.md
index 2f51cc7aa0a1f..b5ad89682de9d 100644
--- a/solution/2800-2899/2827.Number of Beautiful Integers in the Range/README.md	
+++ b/solution/2800-2899/2827.Number of Beautiful Integers in the Range/README.md	
@@ -86,7 +86,7 @@
 
 相似题目：
 
--   [2719. 统计整数数目](/solution/2700-2799/2719.Count%20of%20Integers/README.md)
+-   [2719. 统计整数数目](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2719.Count%20of%20Integers/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2827.Number of Beautiful Integers in the Range/README_EN.md b/solution/2800-2899/2827.Number of Beautiful Integers in the Range/README_EN.md
index 7320fb9e600de..31b7f8c302b06 100644
--- a/solution/2800-2899/2827.Number of Beautiful Integers in the Range/README_EN.md	
+++ b/solution/2800-2899/2827.Number of Beautiful Integers in the Range/README_EN.md	
@@ -82,7 +82,7 @@ The time complexity is $O((\log M)^2 \times k \times |\Sigma|)$, and the space c
 
 Similar problems:
 
--   [2719. Count of Integers](/solution/2700-2799/2719.Count%20of%20Integers/README_EN.md)
+-   [2719. Count of Integers](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2719.Count%20of%20Integers/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2836.Maximize Value of Function in a Ball Passing Game/README.md b/solution/2800-2899/2836.Maximize Value of Function in a Ball Passing Game/README.md
index 57fbb31d7c427..a39e29c8de16c 100644
--- a/solution/2800-2899/2836.Maximize Value of Function in a Ball Passing Game/README.md	
+++ b/solution/2800-2899/2836.Maximize Value of Function in a Ball Passing Game/README.md	
@@ -154,7 +154,7 @@
 
 相似题目：
 
--   [1483. 树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md)
+-   [1483. 树节点的第 K 个祖先](https://github.com/doocs/leetcode/blob/main/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2836.Maximize Value of Function in a Ball Passing Game/README_EN.md b/solution/2800-2899/2836.Maximize Value of Function in a Ball Passing Game/README_EN.md
index ec44f7d127e97..682a428110f90 100644
--- a/solution/2800-2899/2836.Maximize Value of Function in a Ball Passing Game/README_EN.md	
+++ b/solution/2800-2899/2836.Maximize Value of Function in a Ball Passing Game/README_EN.md	
@@ -146,7 +146,7 @@ The time complexity is $O(n \times \log k)$, and the space complexity is $O(n \t
 
 Similar problems:
 
--   [1483. Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md)
+-   [1483. Kth Ancestor of a Tree Node](https://github.com/doocs/leetcode/blob/main/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2839.Check if Strings Can be Made Equal With Operations I/README.md b/solution/2800-2899/2839.Check if Strings Can be Made Equal With Operations I/README.md
index 4390ca5e41a49..ded4f0779311b 100644
--- a/solution/2800-2899/2839.Check if Strings Can be Made Equal With Operations I/README.md	
+++ b/solution/2800-2899/2839.Check if Strings Can be Made Equal With Operations I/README.md	
@@ -57,7 +57,7 @@
 
 相似题目：
 
--   [2840. 判断通过操作能否让字符串相等 II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README.md)
+-   [2840. 判断通过操作能否让字符串相等 II](https://github.com/doocs/leetcode/blob/main/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2839.Check if Strings Can be Made Equal With Operations I/README_EN.md b/solution/2800-2899/2839.Check if Strings Can be Made Equal With Operations I/README_EN.md
index 205c1b8fd5bd7..b7674639ed3a1 100644
--- a/solution/2800-2899/2839.Check if Strings Can be Made Equal With Operations I/README_EN.md	
+++ b/solution/2800-2899/2839.Check if Strings Can be Made Equal With Operations I/README_EN.md	
@@ -53,7 +53,7 @@ The time complexity is $O(n + |\Sigma|)$, and the space complexity is $O(|\Sigma
 
 Similar problems:
 
--   [2840. Check if Strings Can be Made Equal With Operations II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README_EN.md)
+-   [2840. Check if Strings Can be Made Equal With Operations II](https://github.com/doocs/leetcode/blob/main/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2840.Check if Strings Can be Made Equal With Operations II/README.md b/solution/2800-2899/2840.Check if Strings Can be Made Equal With Operations II/README.md
index 84bb42b9db4a3..ea5f21cc7b2d8 100644
--- a/solution/2800-2899/2840.Check if Strings Can be Made Equal With Operations II/README.md	
+++ b/solution/2800-2899/2840.Check if Strings Can be Made Equal With Operations II/README.md	
@@ -63,7 +63,7 @@
 
 相似题目：
 
--   [2839. 判断通过操作能否让字符串相等 I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README.md)
+-   [2839. 判断通过操作能否让字符串相等 I](https://github.com/doocs/leetcode/blob/main/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2800-2899/2840.Check if Strings Can be Made Equal With Operations II/README_EN.md b/solution/2800-2899/2840.Check if Strings Can be Made Equal With Operations II/README_EN.md
index 7270df9b82403..5777f7a639b03 100644
--- a/solution/2800-2899/2840.Check if Strings Can be Made Equal With Operations II/README_EN.md	
+++ b/solution/2800-2899/2840.Check if Strings Can be Made Equal With Operations II/README_EN.md	
@@ -55,7 +55,7 @@ The time complexity is $O(n + |\Sigma|)$, and the space complexity is $O(|\Sigma
 
 Similar problems:
 
--   [2839. Check if Strings Can be Made Equal With Operations I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README_EN.md)
+-   [2839. Check if Strings Can be Made Equal With Operations I](https://github.com/doocs/leetcode/blob/main/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README_EN.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2900-2999/2940.Find Building Where Alice and Bob Can Meet/README.md b/solution/2900-2999/2940.Find Building Where Alice and Bob Can Meet/README.md
index 2019fdb021dec..118c9b1007602 100644
--- a/solution/2900-2999/2940.Find Building Where Alice and Bob Can Meet/README.md	
+++ b/solution/2900-2999/2940.Find Building Where Alice and Bob Can Meet/README.md	
@@ -70,7 +70,7 @@
 
 相似题目：
 
--   [2736. 最大和查询](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README.md)
+-   [2736. 最大和查询](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2736.Maximum%20Sum%20Queries/README.md)
 
 <!-- tabs:start -->
 
diff --git a/solution/2900-2999/2940.Find Building Where Alice and Bob Can Meet/README_EN.md b/solution/2900-2999/2940.Find Building Where Alice and Bob Can Meet/README_EN.md
index 6ecbd23eb7218..05d44186445d1 100644
--- a/solution/2900-2999/2940.Find Building Where Alice and Bob Can Meet/README_EN.md	
+++ b/solution/2900-2999/2940.Find Building Where Alice and Bob Can Meet/README_EN.md	
@@ -67,7 +67,7 @@ The time complexity is $O((n + m) \times \log n + m \times \log m)$, and the spa
 
 Similar problems:
 
--   [2736. Maximum Sum Queries](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README_EN.md)
+-   [2736. Maximum Sum Queries](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2736.Maximum%20Sum%20Queries/README_EN.md)
 
 <!-- tabs:start -->