feat: update solutions to lc problems (doocs#2261)

Author: yanglbme

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

lcof/面试题43. 1～n整数中1出现的次数/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 -->
 

lcof2/剑指 Offer II 012. 左右两边子数组的和相等/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 -->
 

solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md

@@ -81,7 +81,7 @@ for (int i = 0; i < 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 -->
 

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 -->
 

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 -->
 

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 -->
 

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)
 
 <!-- 这里可写通用的实现逻辑 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md

@@ -80,7 +80,7 @@ for (int i = 0; i < 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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->
 

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 -->