feat: update lc problems (#4985)

Author: yanglbme

solution/3300-3399/3315.Construct the Minimum Bitwise Array II/README.md

@@ -201,6 +201,29 @@ function minBitwiseArray(nums: number[]): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn min_bitwise_array(nums: Vec<i32>) -> Vec<i32> {
+        let mut ans: Vec<i32> = Vec::new();
+        for x in nums {
+            if x == 2 {
+                ans.push(-1);
+            } else {
+                for i in 1..32 {
+                    if (((x >> i) & 1) ^ 1) != 0 {
+                        ans.push(x ^ (1 << (i - 1)));
+                        break;
+                    }
+                }
+            }
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3315.Construct the Minimum Bitwise Array II/README_EN.md

@@ -195,6 +195,29 @@ function minBitwiseArray(nums: number[]): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn min_bitwise_array(nums: Vec<i32>) -> Vec<i32> {
+        let mut ans: Vec<i32> = Vec::new();
+        for x in nums {
+            if x == 2 {
+                ans.push(-1);
+            } else {
+                for i in 1..32 {
+                    if (((x >> i) & 1) ^ 1) != 0 {
+                        ans.push(x ^ (1 << (i - 1)));
+                        break;
+                    }
+                }
+            }
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3315.Construct the Minimum Bitwise Array II/Solution.rs

@@ -0,0 +1,18 @@
+impl Solution {
+    pub fn min_bitwise_array(nums: Vec<i32>) -> Vec<i32> {
+        let mut ans: Vec<i32> = Vec::new();
+        for x in nums {
+            if x == 2 {
+                ans.push(-1);
+            } else {
+                for i in 1..32 {
+                    if (((x >> i) & 1) ^ 1) != 0 {
+                        ans.push(x ^ (1 << (i - 1)));
+                        break;
+                    }
+                }
+            }
+        }
+        ans
+    }
+}

solution/3800-3899/3803.Count Residue Prefixes/README.md

@@ -4,6 +4,9 @@ difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3803.Count%20Residue%20Prefixes/README.md
 rating: 1248
 source: 第 484 场周赛 Q1
+tags:
+    - 哈希表
+    - 字符串
 ---
 
 <!-- problem:start -->

solution/3800-3899/3803.Count Residue Prefixes/README_EN.md

@@ -4,6 +4,9 @@ difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3803.Count%20Residue%20Prefixes/README_EN.md
 rating: 1248
 source: Weekly Contest 484 Q1
+tags:
+    - Hash Table
+    - String
 ---
 
 <!-- problem:start -->

solution/3800-3899/3804.Number of Centered Subarrays/README.md

@@ -4,6 +4,10 @@ difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3804.Number%20of%20Centered%20Subarrays/README.md
 rating: 1393
 source: 第 484 场周赛 Q2
+tags:
+    - 数组
+    - 哈希表
+    - 枚举
 ---
 
 <!-- problem:start -->

solution/3800-3899/3804.Number of Centered Subarrays/README_EN.md

@@ -4,6 +4,10 @@ difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3804.Number%20of%20Centered%20Subarrays/README_EN.md
 rating: 1393
 source: Weekly Contest 484 Q2
+tags:
+    - Array
+    - Hash Table
+    - Enumeration
 ---
 
 <!-- problem:start -->

solution/3800-3899/3805.Count Caesar Cipher Pairs/README.md

@@ -4,6 +4,12 @@ difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3805.Count%20Caesar%20Cipher%20Pairs/README.md
 rating: 1624
 source: 第 484 场周赛 Q3
+tags:
+    - 数组
+    - 哈希表
+    - 数学
+    - 字符串
+    - 计数
 ---
 
 <!-- problem:start -->

solution/3800-3899/3805.Count Caesar Cipher Pairs/README_EN.md

@@ -4,6 +4,12 @@ difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3805.Count%20Caesar%20Cipher%20Pairs/README_EN.md
 rating: 1624
 source: Weekly Contest 484 Q3
+tags:
+    - Array
+    - Hash Table
+    - Math
+    - String
+    - Counting
 ---
 
 <!-- problem:start -->

solution/3800-3899/3806.Maximum Bitwise AND After Increment Operations/README.md

@@ -4,6 +4,11 @@ difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3806.Maximum%20Bitwise%20AND%20After%20Increment%20Operations/README.md
 rating: 2259
 source: 第 484 场周赛 Q4
+tags:
+    - 贪心
+    - 位运算
+    - 数组
+    - 排序
 ---
 
 <!-- problem:start -->