Merge branch 'doocs:main' into main

Author: Nothing-avil

solution/0000-0099/0014.Longest Common Prefix/README.md

@@ -4,6 +4,7 @@ difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md
 tags:
     - 字典树
+    - 数组
     - 字符串
 ---
 

solution/0000-0099/0014.Longest Common Prefix/README_EN.md

@@ -4,6 +4,7 @@ difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md
 tags:
     - Trie
+    - Array
     - String
 ---
 

solution/0500-0599/0594.Longest Harmonious Subsequence/README.md

@@ -174,6 +174,28 @@ function findLHS(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn find_lhs(nums: Vec<i32>) -> i32 {
+        let mut cnt = HashMap::new();
+        for &x in &nums {
+            *cnt.entry(x).or_insert(0) += 1;
+        }
+        let mut ans = 0;
+        for (&x, &c) in &cnt {
+            if let Some(&y) = cnt.get(&(x + 1)) {
+                ans = ans.max(c + y);
+            }
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0500-0599/0594.Longest Harmonious Subsequence/README_EN.md

@@ -170,6 +170,28 @@ function findLHS(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn find_lhs(nums: Vec<i32>) -> i32 {
+        let mut cnt = HashMap::new();
+        for &x in &nums {
+            *cnt.entry(x).or_insert(0) += 1;
+        }
+        let mut ans = 0;
+        for (&x, &c) in &cnt {
+            if let Some(&y) = cnt.get(&(x + 1)) {
+                ans = ans.max(c + y);
+            }
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0500-0599/0594.Longest Harmonious Subsequence/Solution.rs

@@ -0,0 +1,17 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn find_lhs(nums: Vec<i32>) -> i32 {
+        let mut cnt = HashMap::new();
+        for &x in &nums {
+            *cnt.entry(x).or_insert(0) += 1;
+        }
+        let mut ans = 0;
+        for (&x, &c) in &cnt {
+            if let Some(&y) = cnt.get(&(x + 1)) {
+                ans = ans.max(c + y);
+            }
+        }
+        ans
+    }
+}

solution/0900-0999/0912.Sort an Array/README.md

@@ -37,13 +37,15 @@ tags:
 <pre>
 <strong>输入：</strong>nums = [5,2,3,1]
 <strong>输出：</strong>[1,2,3,5]
+<strong>解释：</strong>数组排序后，某些数字的位置没有改变（例如，2 和 3），而其他数字的位置发生了改变（例如，1 和 5）。
 </pre>
 
 <p><strong>示例 2：</strong></p>
 
 <pre>
 <strong>输入：</strong>nums = [5,1,1,2,0,0]
 <strong>输出：</strong>[0,0,1,1,2,5]
+<strong>解释：</strong>请注意，nums 的值不一定唯一。
 </pre>
 
 <p>&nbsp;</p>

solution/0900-0999/0912.Sort an Array/README_EN.md

@@ -41,7 +41,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [5,1,1,2,0,0]
 <strong>Output:</strong> [0,0,1,1,2,5]
-<strong>Explanation:</strong> Note that the values of nums are not necessairly unique.
+<strong>Explanation:</strong> Note that the values of nums are not necessarily unique.
 </pre>
 
 <p>&nbsp;</p>

solution/0900-0999/0923.3Sum With Multiplicity/README.md

@@ -12,7 +12,7 @@ tags:
 
 <!-- problem:start -->
 
-# [923. 三数之和的多种可能](https://leetcode.cn/problems/3sum-with-multiplicity)
+# [923. 多重三数之和](https://leetcode.cn/problems/3sum-with-multiplicity)
 
 [English Version](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README_EN.md)
 

solution/1100-1199/1152.Analyze User Website Visit Pattern/README.md

@@ -7,6 +7,7 @@ source: 第 6 场双周赛 Q3
 tags:
     - 数组
     - 哈希表
+    - 字符串
     - 排序
 ---
 

solution/1100-1199/1152.Analyze User Website Visit Pattern/README_EN.md

@@ -7,6 +7,7 @@ source: Biweekly Contest 6 Q3
 tags:
     - Array
     - Hash Table
+    - String
     - Sorting
 ---