feat: add rust solution to lc problem: No.0658

No.0658.Find K Closest Elements

Author: YangFong

solution/0600-0699/0658.Find K Closest Elements/README.md

@@ -102,6 +102,28 @@ class Solution {
 }
 ```
 
+### **Rust**
+
+双指针：
+
+```rust
+impl Solution {
+    pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
+        let n = arr.len();
+        let mut l = 0;
+        let mut r = n;
+        while r - l != k as usize {
+            if (arr[l] - x).abs() <= (arr[r - 1] - x).abs() {
+                r -= 1;
+            } else {
+                l += 1;
+            }
+        }
+        arr[l..r].to_vec()
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0600-0699/0658.Find K Closest Elements/README_EN.md

@@ -86,6 +86,26 @@ class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
+        let n = arr.len();
+        let mut l = 0;
+        let mut r = n;
+        while r - l != k as usize {
+            if (arr[l] - x).abs() <= (arr[r - 1] - x).abs() {
+                r -= 1;
+            } else {
+                l += 1;
+            }
+        }
+        arr[l..r].to_vec()
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0600-0699/0658.Find K Closest Elements/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
+        let n = arr.len();
+        let mut l = 0;
+        let mut r = n;
+        while r - l != k as usize {
+            if (arr[l] - x).abs() <= (arr[r - 1] - x).abs() {
+                r -= 1;
+            } else {
+                l += 1;
+            }
+        }
+        arr[l..r].to_vec()
+    }
+}