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

No.0240.Search a 2D Matrix II

Author: YangFong

solution/0200-0299/0240.Search a 2D Matrix II/README.md

@@ -181,6 +181,29 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
+        let m = matrix.len();
+        let n = matrix[0].len();
+        let mut i = 0;
+        let mut j = n;
+        while i < m && j > 0 {
+            match target.cmp(&matrix[i][j - 1]) {
+                Ordering::Less => j -= 1,
+                Ordering::Greater => i += 1,
+                Ordering::Equal => return true,
+            }
+        }
+        false
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0240.Search a 2D Matrix II/README_EN.md

@@ -169,6 +169,29 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
+        let m = matrix.len();
+        let n = matrix[0].len();
+        let mut i = 0;
+        let mut j = n;
+        while i < m && j > 0 {
+            match target.cmp(&matrix[i][j - 1]) {
+                Ordering::Less => j -= 1,
+                Ordering::Greater => i += 1,
+                Ordering::Equal => return true,
+            }
+        }
+        false
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0240.Search a 2D Matrix II/Solution.rs

@@ -0,0 +1,18 @@
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
+        let m = matrix.len();
+        let n = matrix[0].len();
+        let mut i = 0;
+        let mut j = n;
+        while i < m && j > 0 {
+            match target.cmp(&matrix[i][j - 1]) {
+                Ordering::Less => j -= 1,
+                Ordering::Greater => i += 1,
+                Ordering::Equal => return true,
+            }
+        }
+        false
+    }
+}