feat: add rust solution to lc problem: No.2465 (doocs#1344)

Signed-off-by: xiaolatiao <1628652790@qq.com>

Author: dierbei

solution/2400-2499/2465.Number of Distinct Averages/README.md

@@ -223,6 +223,83 @@ function distinctAverages(nums: number[]): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn distinct_averages(nums: Vec<i32>) -> i32 {
+        let mut nums = nums;
+        nums.sort();
+        let n = nums.len();
+        let mut cnt = vec![0; 201];
+        let mut ans = 0;
+
+        for i in 0..n >> 1 {
+            let x = (nums[i] + nums[n - i - 1]) as usize;
+            cnt[x] += 1;
+        
+            if cnt[x] == 1 {
+                ans += 1;
+            }
+        }
+
+        ans
+    }
+}
+```
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn distinct_averages(nums: Vec<i32>) -> i32 {
+        let mut h = HashMap::new();
+        let mut nums = nums;
+        let mut ans = 0;
+        let n = nums.len();
+        nums.sort();
+
+        for i in 0..n >> 1 {
+            let x = nums[i] + nums[n - i - 1];
+            *h.entry(x).or_insert(0) += 1;
+
+            if *h.get(&x).unwrap() == 1 {
+                ans += 1;
+            }
+        }
+
+        ans
+    }
+}
+```
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn distinct_averages(nums: Vec<i32>) -> i32 {
+        let mut set = HashSet::new();
+        let mut ans = 0;
+        let n = nums.len();
+        let mut nums = nums;
+        nums.sort();
+
+        for i in 0..n >> 1 {
+            let x = nums[i] + nums[n - i - 1];
+
+            if set.contains(&x) {
+                continue;
+            }
+
+            set.insert(x);
+            ans += 1;
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2400-2499/2465.Number of Distinct Averages/README_EN.md

@@ -209,6 +209,83 @@ function distinctAverages(nums: number[]): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn distinct_averages(nums: Vec<i32>) -> i32 {
+        let mut nums = nums;
+        nums.sort();
+        let n = nums.len();
+        let mut cnt = vec![0; 201];
+        let mut ans = 0;
+
+        for i in 0..n >> 1 {
+            let x = (nums[i] + nums[n - i - 1]) as usize;
+            cnt[x] += 1;
+        
+            if cnt[x] == 1 {
+                ans += 1;
+            }
+        }
+
+        ans
+    }
+}
+```
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn distinct_averages(nums: Vec<i32>) -> i32 {
+        let mut h = HashMap::new();
+        let mut nums = nums;
+        let mut ans = 0;
+        let n = nums.len();
+        nums.sort();
+
+        for i in 0..n >> 1 {
+            let x = nums[i] + nums[n - i - 1];
+            *h.entry(x).or_insert(0) += 1;
+
+            if *h.get(&x).unwrap() == 1 {
+                ans += 1;
+            }
+        }
+
+        ans
+    }
+}
+```
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn distinct_averages(nums: Vec<i32>) -> i32 {
+        let mut set = HashSet::new();
+        let mut ans = 0;
+        let n = nums.len();
+        let mut nums = nums;
+        nums.sort();
+
+        for i in 0..n >> 1 {
+            let x = nums[i] + nums[n - i - 1];
+
+            if set.contains(&x) {
+                continue;
+            }
+
+            set.insert(x);
+            ans += 1;
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2400-2499/2465.Number of Distinct Averages/Solution.rs

@@ -0,0 +1,24 @@
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn distinct_averages(nums: Vec<i32>) -> i32 {
+        let mut set = HashSet::new();
+        let mut ans = 0;
+        let n = nums.len();
+        let mut nums = nums;
+        nums.sort();
+
+        for i in 0..n >> 1 {
+            let x = nums[i] + nums[n - i - 1];
+
+            if set.contains(&x) {
+                continue;
+            }
+
+            set.insert(x);
+            ans += 1;
+        }
+
+        ans
+    }
+}