feat: add rust solution to lc problem: No.1380

No.1380.Lucky Numbers in a Matrix

Author: YangFong

solution/1300-1399/1380.Lucky Numbers in a Matrix/README.md

@@ -167,6 +167,36 @@ func max(a, b int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn lucky_numbers(matrix: Vec<Vec<i32>>) -> Vec<i32> {
+        let m = matrix.len();
+        let n = matrix[0].len();
+        let mut res = vec![];
+        let mut col = vec![0; n];
+        for j in 0..n {
+            for i in 0..m {
+                col[j] = col[j].max(matrix[i][j]);
+            }
+        }
+        for x in 0..m {
+            let mut i = 0;
+            for y in 1..n {
+                if matrix[x][y] < matrix[x][i] {
+                    i = y;
+                }
+            }
+            if matrix[x][i] == col[i] {
+                res.push(col[i]);
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1380.Lucky Numbers in a Matrix/README_EN.md

@@ -153,6 +153,36 @@ func max(a, b int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn lucky_numbers(matrix: Vec<Vec<i32>>) -> Vec<i32> {
+        let m = matrix.len();
+        let n = matrix[0].len();
+        let mut res = vec![];
+        let mut col = vec![0; n];
+        for j in 0..n {
+            for i in 0..m {
+                col[j] = col[j].max(matrix[i][j]);
+            }
+        }
+        for x in 0..m {
+            let mut i = 0;
+            for y in 1..n {
+                if matrix[x][y] < matrix[x][i] {
+                    i = y;
+                }
+            }
+            if matrix[x][i] == col[i] {
+                res.push(col[i]);
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1380.Lucky Numbers in a Matrix/Solution.rs

@@ -0,0 +1,25 @@
+impl Solution {
+    pub fn lucky_numbers(matrix: Vec<Vec<i32>>) -> Vec<i32> {
+        let m = matrix.len();
+        let n = matrix[0].len();
+        let mut res = vec![];
+        let mut col = vec![0; n];
+        for j in 0..n {
+            for i in 0..m {
+                col[j] = col[j].max(matrix[i][j]);
+            }
+        }
+        for x in 0..m {
+            let mut i = 0;
+            for y in 1..n {
+                if matrix[x][y] < matrix[x][i] {
+                    i = y;
+                }
+            }
+            if matrix[x][i] == col[i] {
+                res.push(col[i]);
+            }
+        }
+        res
+    }
+}