feat: update lc problems (#5173)

Author: yanglbme

solution/2600-2699/2615.Sum of Distances/README.md

@@ -32,10 +32,10 @@ tags:
 <strong>输入：</strong>nums = [1,3,1,1,2]
 <strong>输出：</strong>[5,0,3,4,0]
 <strong>解释：</strong>
-i = 0 ，nums[0] == nums[2] 且 nums[0] == nums[3] 。因此，arr[0] = |0 - 2| + |0 - 3| = 5 。
+i = 0 ，nums[0] == nums[2] 且 nums[0] == nums[3] 。因此，arr[0] = |0 - 2| + |0 - 3| = 5 。 
 i = 1 ，arr[1] = 0 因为不存在值等于 3 的其他下标。
 i = 2 ，nums[2] == nums[0] 且 nums[2] == nums[3] 。因此，arr[2] = |2 - 0| + |2 - 3| = 3 。
-i = 3 ，nums[3] == nums[0] 且 nums[3] == nums[2] 。因此，arr[3] = |3 - 0| + |3 - 2| = 4 。
+i = 3 ，nums[3] == nums[0] 且 nums[3] == nums[2] 。因此，arr[3] = |3 - 0| + |3 - 2| = 4 。 
 i = 4 ，arr[4] = 0 因为不存在值等于 2 的其他下标。
 </pre>
 
@@ -213,7 +213,7 @@ function distance(nums: number[]): number[] {
         }
     }
     return ans;
-};
+}
 ```
 
 #### Rust

solution/2600-2699/2615.Sum of Distances/README_EN.md

@@ -30,12 +30,12 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [1,3,1,1,2]
 <strong>Output:</strong> [5,0,3,4,0]
-<strong>Explanation:</strong>
-When i = 0, nums[0] == nums[2] and nums[0] == nums[3]. Therefore, arr[0] = |0 - 2| + |0 - 3| = 5.
+<strong>Explanation:</strong> 
+When i = 0, nums[0] == nums[2] and nums[0] == nums[3]. Therefore, arr[0] = |0 - 2| + |0 - 3| = 5. 
 When i = 1, arr[1] = 0 because there is no other index with value 3.
-When i = 2, nums[2] == nums[0] and nums[2] == nums[3]. Therefore, arr[2] = |2 - 0| + |2 - 3| = 3.
-When i = 3, nums[3] == nums[0] and nums[3] == nums[2]. Therefore, arr[3] = |3 - 0| + |3 - 2| = 4.
-When i = 4, arr[4] = 0 because there is no other index with value 2.
+When i = 2, nums[2] == nums[0] and nums[2] == nums[3]. Therefore, arr[2] = |2 - 0| + |2 - 3| = 3. 
+When i = 3, nums[3] == nums[0] and nums[3] == nums[2]. Therefore, arr[3] = |3 - 0| + |3 - 2| = 4. 
+When i = 4, arr[4] = 0 because there is no other index with value 2. 
 
 </pre>
 
@@ -215,7 +215,7 @@ function distance(nums: number[]): number[] {
         }
     }
     return ans;
-};
+}
 ```
 
 #### Rust

solution/2600-2699/2615.Sum of Distances/Solution.ts

@@ -24,4 +24,4 @@ function distance(nums: number[]): number[] {
         }
     }
     return ans;
-};
+}

solution/3200-3299/3213.Construct String with Minimum Cost/README.md

@@ -371,7 +371,8 @@ class Hashing {
     }
 
     public query(l: number, r: number): number {
-        const res = (this.h[r] - this.h[l - 1] * this.p[r - l + 1] % this.mod + this.mod) % this.mod;
+        const res =
+            (this.h[r] - ((this.h[l - 1] * this.p[r - l + 1]) % this.mod) + this.mod) % this.mod;
         return Number(res);
     }
 }

solution/3200-3299/3213.Construct String with Minimum Cost/README_EN.md

@@ -371,7 +371,8 @@ class Hashing {
     }
 
     public query(l: number, r: number): number {
-        const res = (this.h[r] - this.h[l - 1] * this.p[r - l + 1] % this.mod + this.mod) % this.mod;
+        const res =
+            (this.h[r] - ((this.h[l - 1] * this.p[r - l + 1]) % this.mod) + this.mod) % this.mod;
         return Number(res);
     }
 }

solution/3200-3299/3213.Construct String with Minimum Cost/Solution.ts

@@ -18,7 +18,8 @@ class Hashing {
     }
 
     public query(l: number, r: number): number {
-        const res = (this.h[r] - this.h[l - 1] * this.p[r - l + 1] % this.mod + this.mod) % this.mod;
+        const res =
+            (this.h[r] - ((this.h[l - 1] * this.p[r - l + 1]) % this.mod) + this.mod) % this.mod;
         return Number(res);
     }
 }

solution/3900-3999/3901.Good Subsequence Queries/README.md

@@ -30,7 +30,7 @@ source: 第 497 场周赛 Q4
 
 <p>在每次查询更新后，判断当前数组中是否存在<strong>&nbsp;任意一个好子序列</strong>。</p>
 
-<p>返回一个整数，表示在多少次查询之后，数组中存在&nbsp;<strong>好子序列</strong>。</p>
+<p>返回一个整数，表示使得数组中存在&nbsp;<strong>好子序列</strong>&nbsp;的查询&nbsp;<strong>次数</strong>。</p>
 
 <p><strong>子序列</strong>&nbsp;是指通过删除原序列中的某些元素或不删除任何元素，并且不改变剩余元素相对顺序后得到的序列。</p>
 

solution/3900-3999/3902.Zigzag Level Sum of Binary Tree/README.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3902.Zigzag%20Level%20Sum%20of%20Binary%20Tree/README.md
+tags:
+    - 树
+    - 广度优先搜索
+    - 二叉树
 ---
 
 <!-- problem:start -->

solution/3900-3999/3902.Zigzag Level Sum of Binary Tree/README_EN.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3902.Zigzag%20Level%20Sum%20of%20Binary%20Tree/README_EN.md
+tags:
+    - Tree
+    - Breadth-First Search
+    - Binary Tree
 ---
 
 <!-- problem:start -->

solution/3900-3999/3903.Smallest Stable Index I/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3903.Smallest%20Stable%20Index%20I/README.md
+tags:
+    - 数组
 ---
 
 <!-- problem:start -->