feat: add solutions to lc problems: No.3687~3689 (#4738)

Author: yanglbme

solution/0300-0399/0358.Rearrange String k Distance Apart/README.md

@@ -29,15 +29,15 @@ tags:
 
 <pre>
 <strong>输入: </strong>s = "aabbcc", k = 3
-<strong>输出: </strong>"abcabc"
+<strong>输出: </strong>"abcabc" 
 <strong>解释: </strong>相同的字母在新的字符串中间隔至少 3 个单位距离。
 </pre>
 
 <p><strong>示例 2:</strong></p>
 
 <pre>
 <strong>输入: </strong>s = "aaabc", k = 3
-<strong>输出: </strong>""
+<strong>输出: </strong>"" 
 <strong>解释:</strong> 没有办法找到可能的重排结果。
 </pre>
 

solution/2100-2199/2197.Replace Non-Coprime Numbers in Array/README.md

@@ -62,8 +62,8 @@ tags:
 - (3, 3) 是一组非互质数，且 LCM(3, 3) = 3 。得到 nums = [2,2,1,1,<em><strong>3</strong></em>,3] 。
 - (3, 3) 是一组非互质数，且 LCM(3, 3) = 3 。得到 nums = [2,2,1,1,<em><strong>3</strong></em>] 。
 - (2, 2) 是一组非互质数，且 LCM(2, 2) = 2 。得到 nums = [<em><strong>2</strong></em>,1,1,3] 。
-现在，nums 中不存在相邻的非互质数。
-因此，修改后得到的最终数组是 [2,1,1,3] 。
+现在，nums 中不存在相邻的非互质数。 
+因此，修改后得到的最终数组是 [2,1,1,3] 。 
 注意，存在其他方法可以获得相同的最终数组。
 </pre>
 

solution/2100-2199/2197.Replace Non-Coprime Numbers in Array/README_EN.md

@@ -42,7 +42,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [6,4,3,2,7,6,2]
 <strong>Output:</strong> [12,7,6]
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 - (6, 4) are non-coprime with LCM(6, 4) = 12. Now, nums = [<strong><u>12</u></strong>,3,2,7,6,2].
 - (12, 3) are non-coprime with LCM(12, 3) = 12. Now, nums = [<strong><u>12</u></strong>,2,7,6,2].
 - (12, 2) are non-coprime with LCM(12, 2) = 12. Now, nums = [<strong><u>12</u></strong>,7,6,2].
@@ -57,7 +57,7 @@ Note that there are other ways to obtain the same resultant array.
 <pre>
 <strong>Input:</strong> nums = [2,2,1,1,3,3,3]
 <strong>Output:</strong> [2,1,1,3]
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 - (3, 3) are non-coprime with LCM(3, 3) = 3. Now, nums = [2,2,1,1,<u><strong>3</strong></u>,3].
 - (3, 3) are non-coprime with LCM(3, 3) = 3. Now, nums = [2,2,1,1,<u><strong>3</strong></u>].
 - (2, 2) are non-coprime with LCM(2, 2) = 2. Now, nums = [<u><strong>2</strong></u>,1,1,3].

solution/3600-3699/3678.Smallest Absent Positive Greater Than Average/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3678.Smallest%20Absent%20Positive%20Greater%20Than%20Average/README.md
+rating: 1306
+source: 第 165 场双周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3600-3699/3678.Smallest Absent Positive Greater Than Average/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3678.Smallest%20Absent%20Positive%20Greater%20Than%20Average/README_EN.md
+rating: 1306
+source: Biweekly Contest 165 Q1
 ---
 
 <!-- problem:start -->

solution/3600-3699/3679.Minimum Discards to Balance Inventory/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3679.Minimum%20Discards%20to%20Balance%20Inventory/README.md
+rating: 1638
+source: 第 165 场双周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3600-3699/3679.Minimum Discards to Balance Inventory/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3679.Minimum%20Discards%20to%20Balance%20Inventory/README_EN.md
+rating: 1638
+source: Biweekly Contest 165 Q2
 ---
 
 <!-- problem:start -->

solution/3600-3699/3680.Generate Schedule/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3680.Generate%20Schedule/README.md
+rating: 2377
+source: 第 165 场双周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3600-3699/3680.Generate Schedule/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3680.Generate%20Schedule/README_EN.md
+rating: 2377
+source: Biweekly Contest 165 Q3
 ---
 
 <!-- problem:start -->

solution/3600-3699/3681.Maximum XOR of Subsequences/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3681.Maximum%20XOR%20of%20Subsequences/README.md
+rating: 2026
+source: 第 165 场双周赛 Q4
 ---
 
 <!-- problem:start -->