feat: add rust solution to lc problem: No.2605 (#1160)

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

Author: dierbei

Diff for: solution/2600-2699/2605.Form Smallest Number From Two Digit Arrays/README.md

@@ -424,6 +424,67 @@ function numberOfTrailingZeros(i: number): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_number(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        let mut ans = 100;
+
+        for &a in &nums1 {
+            for &b in &nums2 {
+                if a == b {
+                    ans = std::cmp::min(ans, a);
+                } else {
+                    ans = std::cmp::min(ans, std::cmp::min(a * 10 + b, b * 10 + a));
+                }
+
+            }
+        }
+
+        ans
+    }
+}
+```
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn min_number(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        let mut h1: HashMap<i32, bool> = HashMap::new();
+
+        for &n in &nums1 {
+            h1.insert(n, true);
+        }
+
+        let mut h2: HashMap<i32, bool> = HashMap::new();
+        for &n in &nums2 {
+            h2.insert(n, true);
+        }
+
+        let mut a = 0;
+        let mut b = 0;
+        for i in 1..10 {
+            if h1.contains_key(&i) && h2.contains_key(&i) {
+                return i;
+            }
+
+            if a == 0 && h1.contains_key(&i) {
+                a = i;
+            }
+
+            if b == 0 && h2.contains_key(&i) {
+                b = i;
+            } 
+        }
+
+
+        std::cmp::min(a * 10 + b, b * 10 + a)
+    }
+}
+```
+
 ### **...**
 
 ```

Diff for: solution/2600-2699/2605.Form Smallest Number From Two Digit Arrays/README_EN.md

@@ -416,6 +416,67 @@ function numberOfTrailingZeros(i: number): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_number(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        let mut ans = 100;
+
+        for &a in &nums1 {
+            for &b in &nums2 {
+                if a == b {
+                    ans = std::cmp::min(ans, a);
+                } else {
+                    ans = std::cmp::min(ans, std::cmp::min(a * 10 + b, b * 10 + a));
+                }
+
+            }
+        }
+
+        ans
+    }
+}
+```
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn min_number(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        let mut h1: HashMap<i32, bool> = HashMap::new();
+
+        for &n in &nums1 {
+            h1.insert(n, true);
+        }
+
+        let mut h2: HashMap<i32, bool> = HashMap::new();
+        for &n in &nums2 {
+            h2.insert(n, true);
+        }
+
+        let mut a = 0;
+        let mut b = 0;
+        for i in 1..10 {
+            if h1.contains_key(&i) && h2.contains_key(&i) {
+                return i;
+            }
+
+            if a == 0 && h1.contains_key(&i) {
+                a = i;
+            }
+
+            if b == 0 && h2.contains_key(&i) {
+                b = i;
+            } 
+        }
+
+
+        std::cmp::min(a * 10 + b, b * 10 + a)
+    }
+}
+```
+
 ### **...**
 
 ```

Diff for: solution/2600-2699/2605.Form Smallest Number From Two Digit Arrays/Solution.rs

@@ -0,0 +1,35 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn min_number(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        let mut h1: HashMap<i32, bool> = HashMap::new();
+
+        for &n in &nums1 {
+            h1.insert(n, true);
+        }
+
+        let mut h2: HashMap<i32, bool> = HashMap::new();
+        for &n in &nums2 {
+            h2.insert(n, true);
+        }
+
+        let mut a = 0;
+        let mut b = 0;
+        for i in 1..10 {
+            if h1.contains_key(&i) && h2.contains_key(&i) {
+                return i;
+            }
+
+            if a == 0 && h1.contains_key(&i) {
+                a = i;
+            }
+
+            if b == 0 && h2.contains_key(&i) {
+                b = i;
+            }
+        }
+
+
+        std::cmp::min(a * 10 + b, b * 10 + a)
+    }
+}