feat: add rust solution to lc problem: No.2643 (#1129)

Author: dierbei

solution/2600-2699/2643.Row With Maximum Ones/README.md

@@ -158,6 +158,26 @@ function rowAndMaximumOnes(mat: number[][]): number[] {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn row_and_maximum_ones(mat: Vec<Vec<i32>>) -> Vec<i32> {
+        let mut ans = vec![0, 0];
+
+        for (i, row) in mat.iter().enumerate() {
+            let cnt = row.iter().filter(|&v| *v == 1).count() as i32;
+            if ans[1] < cnt {
+                ans[0] = i as i32;
+                ans[1] = cnt;
+            }
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2643.Row With Maximum Ones/README_EN.md

@@ -143,6 +143,26 @@ function rowAndMaximumOnes(mat: number[][]): number[] {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn row_and_maximum_ones(mat: Vec<Vec<i32>>) -> Vec<i32> {
+        let mut ans = vec![0, 0];
+
+        for (i, row) in mat.iter().enumerate() {
+            let cnt = row.iter().filter(|&v| *v == 1).count() as i32;
+            if ans[1] < cnt {
+                ans[0] = i as i32;
+                ans[1] = cnt;
+            }
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2643.Row With Maximum Ones/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn row_and_maximum_ones(mat: Vec<Vec<i32>>) -> Vec<i32> {
+        let mut ans = vec![0, 0];
+
+        for (i, row) in mat.iter().enumerate() {
+            let cnt = row.iter().filter(|&v| *v == 1).count() as i32;
+            if ans[1] < cnt {
+                ans[0] = i as i32;
+                ans[1] = cnt;
+            }
+        }
+
+        ans
+    }
+}