feat: add Rust solution for lc No.3761 (#5163)

Author: yanglbme

solution/3700-3799/3761.Minimum Absolute Distance Between Mirror Pairs/README.md

@@ -238,6 +238,38 @@ function minMirrorPairDistance(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn min_mirror_pair_distance(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let mut ans = n as i32 + 1;
+        let mut pos: HashMap<i32, i32> = HashMap::new();
+
+        fn reverse(mut x: i32) -> i32 {
+            let mut y = 0;
+            while x > 0 {
+                y = y * 10 + x % 10;
+                x /= 10;
+            }
+            y
+        }
+
+        for (i, &v) in nums.iter().enumerate() {
+            if let Some(&j) = pos.get(&v) {
+                ans = ans.min(i as i32 - j);
+            }
+            pos.insert(reverse(v), i as i32);
+        }
+
+        if ans > n as i32 { -1 } else { ans }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3700-3799/3761.Minimum Absolute Distance Between Mirror Pairs/README_EN.md

@@ -235,6 +235,38 @@ function minMirrorPairDistance(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn min_mirror_pair_distance(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let mut ans = n as i32 + 1;
+        let mut pos: HashMap<i32, i32> = HashMap::new();
+
+        fn reverse(mut x: i32) -> i32 {
+            let mut y = 0;
+            while x > 0 {
+                y = y * 10 + x % 10;
+                x /= 10;
+            }
+            y
+        }
+
+        for (i, &v) in nums.iter().enumerate() {
+            if let Some(&j) = pos.get(&v) {
+                ans = ans.min(i as i32 - j);
+            }
+            pos.insert(reverse(v), i as i32);
+        }
+
+        if ans > n as i32 { -1 } else { ans }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3700-3799/3761.Minimum Absolute Distance Between Mirror Pairs/Solution.rs

@@ -0,0 +1,27 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn min_mirror_pair_distance(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let mut ans = n as i32 + 1;
+        let mut pos: HashMap<i32, i32> = HashMap::new();
+
+        fn reverse(mut x: i32) -> i32 {
+            let mut y = 0;
+            while x > 0 {
+                y = y * 10 + x % 10;
+                x /= 10;
+            }
+            y
+        }
+
+        for (i, &v) in nums.iter().enumerate() {
+            if let Some(&j) = pos.get(&v) {
+                ans = ans.min(i as i32 - j);
+            }
+            pos.insert(reverse(v), i as i32);
+        }
+
+        if ans > n as i32 { -1 } else { ans }
+    }
+}