feat: add rust solution to lcof problem: No.04

剑指 Offer 04. 二维数组中的查找

Author: YangFong

lcof/面试题04. 二维数组中的查找/README.md

@@ -179,6 +179,37 @@ function findNumberIn2DArray(matrix: number[][], target: number): boolean {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_number_in2_d_array(matrix: Vec<Vec<i32>>, target: i32) -> bool {
+        let len_y = matrix.len();
+        if len_y == 0 {
+            return false;
+        }
+        let len_x = matrix[0].len();
+        if len_x == 0 {
+            return false;
+        }
+
+        let mut x = len_x - 1;
+        let mut y = 0;
+        while y < len_y {
+            match target.cmp(&matrix[y][x]) {
+                std::cmp::Ordering::Greater => y += 1,
+                std::cmp::Ordering::Equal => return true,
+                std::cmp::Ordering::Less => match x {
+                    0 => return false,
+                    _ => x -= 1,
+                },
+            }
+        }
+        false
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题04. 二维数组中的查找/Solution.rs

@@ -0,0 +1,26 @@
+impl Solution {
+    pub fn find_number_in2_d_array(matrix: Vec<Vec<i32>>, target: i32) -> bool {
+        let len_y = matrix.len();
+        if len_y == 0 {
+            return false;
+        }
+        let len_x = matrix[0].len();
+        if len_x == 0 {
+            return false;
+        }
+
+        let mut x = len_x - 1;
+        let mut y = 0;
+        while y < len_y {
+            match target.cmp(&matrix[y][x]) {
+                std::cmp::Ordering::Greater => y += 1,
+                std::cmp::Ordering::Equal => return true,
+                std::cmp::Ordering::Less => match x {
+                    0 => return false,
+                    _ => x -= 1,
+                },
+            }
+        }
+        false
+    }
+}