feat: add solutions to lc problem: No.1007 (#4384)

No.1007.Minimum Domino Rotations For Equal Row

Author: yanglbme

solution/1000-1099/1007.Minimum Domino Rotations For Equal Row/README.md

@@ -199,6 +199,35 @@ function minDominoRotations(tops: number[], bottoms: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn min_domino_rotations(tops: Vec<i32>, bottoms: Vec<i32>) -> i32 {
+        let n = tops.len() as i32;
+        let f = |x: i32| -> i32 {
+            let mut cnt1 = 0;
+            let mut cnt2 = 0;
+            for i in 0..n as usize {
+                if tops[i] != x && bottoms[i] != x {
+                    return n + 1;
+                }
+                if tops[i] == x {
+                    cnt1 += 1;
+                }
+                if bottoms[i] == x {
+                    cnt2 += 1;
+                }
+            }
+            n - cnt1.max(cnt2)
+        };
+
+        let ans = f(tops[0]).min(f(bottoms[0]));
+        if ans > n { -1 } else { ans }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1000-1099/1007.Minimum Domino Rotations For Equal Row/README_EN.md

@@ -198,6 +198,35 @@ function minDominoRotations(tops: number[], bottoms: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn min_domino_rotations(tops: Vec<i32>, bottoms: Vec<i32>) -> i32 {
+        let n = tops.len() as i32;
+        let f = |x: i32| -> i32 {
+            let mut cnt1 = 0;
+            let mut cnt2 = 0;
+            for i in 0..n as usize {
+                if tops[i] != x && bottoms[i] != x {
+                    return n + 1;
+                }
+                if tops[i] == x {
+                    cnt1 += 1;
+                }
+                if bottoms[i] == x {
+                    cnt2 += 1;
+                }
+            }
+            n - cnt1.max(cnt2)
+        };
+
+        let ans = f(tops[0]).min(f(bottoms[0]));
+        if ans > n { -1 } else { ans }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1000-1099/1007.Minimum Domino Rotations For Equal Row/Solution.rs

@@ -0,0 +1,28 @@
+impl Solution {
+    pub fn min_domino_rotations(tops: Vec<i32>, bottoms: Vec<i32>) -> i32 {
+        let n = tops.len() as i32;
+        let f = |x: i32| -> i32 {
+            let mut cnt1 = 0;
+            let mut cnt2 = 0;
+            for i in 0..n as usize {
+                if tops[i] != x && bottoms[i] != x {
+                    return n + 1;
+                }
+                if tops[i] == x {
+                    cnt1 += 1;
+                }
+                if bottoms[i] == x {
+                    cnt2 += 1;
+                }
+            }
+            n - cnt1.max(cnt2)
+        };
+
+        let ans = f(tops[0]).min(f(bottoms[0]));
+        if ans > n {
+            -1
+        } else {
+            ans
+        }
+    }
+}