feat: add rust solution to lcci problem: No.17.11

No.17.11.Find Closest

Author: YangFong

lcci/17.11.Find Closest/README.md

@@ -136,6 +136,30 @@ func abs(x int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_closest(words: Vec<String>, word1: String, word2: String) -> i32 {
+        let mut res = i32::MAX;
+        let mut index1 = -1;
+        let mut index2 = -1;
+        for (i, word) in words.iter().enumerate() {
+            let i = i as i32;
+            if word.eq(&word1) {
+                index1 = i;
+            } else if word.eq(&word2) {
+                index2 = i;
+            }
+            if index1 != -1 && index2 != -1 {
+                res = res.min((index1 - index2).abs());
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/17.11.Find Closest/README_EN.md

@@ -132,6 +132,30 @@ func abs(x int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_closest(words: Vec<String>, word1: String, word2: String) -> i32 {
+        let mut res = i32::MAX;
+        let mut index1 = -1;
+        let mut index2 = -1;
+        for (i, word) in words.iter().enumerate() {
+            let i = i as i32;
+            if word.eq(&word1) {
+                index1 = i;
+            } else if word.eq(&word2) {
+                index2 = i;
+            }
+            if index1 != -1 && index2 != -1 {
+                res = res.min((index1 - index2).abs());
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/17.11.Find Closest/Solution.rs

@@ -0,0 +1,19 @@
+impl Solution {
+    pub fn find_closest(words: Vec<String>, word1: String, word2: String) -> i32 {
+        let mut res = i32::MAX;
+        let mut index1 = -1;
+        let mut index2 = -1;
+        for (i, word) in words.iter().enumerate() {
+            let i = i as i32;
+            if word.eq(&word1) {
+                index1 = i;
+            } else if word.eq(&word2) {
+                index2 = i;
+            }
+            if index1 != -1 && index2 != -1 {
+                res = res.min((index1 - index2).abs());
+            }
+        }
+        res
+    }
+}