feat: add rust solution to lc problems: No.3025,3027 (#4691)

Author: yanglbme

solution/1400-1499/1405.Longest Happy String/Solution.ts

@@ -1,5 +1,5 @@
 function longestDiverseString(a: number, b: number, c: number): string {
-    let ans = [];
+    let ans: string[] = [];
     let store: Array<[string, number]> = [
         ['a', a],
         ['b', b],

solution/3000-3099/3025.Find the Number of Ways to Place People I/README.md

@@ -230,6 +230,37 @@ function numberOfPairs(points: number[][]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn number_of_pairs(mut points: Vec<Vec<i32>>) -> i32 {
+        points.sort_by(|a, b| {
+            if a[0] == b[0] {
+                b[1].cmp(&a[1])
+            } else {
+                a[0].cmp(&b[0])
+            }
+        });
+
+        let n = points.len();
+        let mut ans = 0;
+        for i in 0..n {
+            let y1 = points[i][1];
+            let mut max_y = i32::MIN;
+            for j in (i + 1)..n {
+                let y2 = points[j][1];
+                if max_y < y2 && y2 <= y1 {
+                    max_y = y2;
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}
+```
+
 #### C#
 
 ```cs

solution/3000-3099/3025.Find the Number of Ways to Place People I/README_EN.md

@@ -225,6 +225,37 @@ function numberOfPairs(points: number[][]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn number_of_pairs(mut points: Vec<Vec<i32>>) -> i32 {
+        points.sort_by(|a, b| {
+            if a[0] == b[0] {
+                b[1].cmp(&a[1])
+            } else {
+                a[0].cmp(&b[0])
+            }
+        });
+
+        let n = points.len();
+        let mut ans = 0;
+        for i in 0..n {
+            let y1 = points[i][1];
+            let mut max_y = i32::MIN;
+            for j in (i + 1)..n {
+                let y2 = points[j][1];
+                if max_y < y2 && y2 <= y1 {
+                    max_y = y2;
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}
+```
+
 #### C#
 
 ```cs

solution/3000-3099/3025.Find the Number of Ways to Place People I/Solution.rs

@@ -0,0 +1,26 @@
+impl Solution {
+    pub fn number_of_pairs(mut points: Vec<Vec<i32>>) -> i32 {
+        points.sort_by(|a, b| {
+            if a[0] == b[0] {
+                b[1].cmp(&a[1])
+            } else {
+                a[0].cmp(&b[0])
+            }
+        });
+
+        let n = points.len();
+        let mut ans = 0;
+        for i in 0..n {
+            let y1 = points[i][1];
+            let mut max_y = i32::MIN;
+            for j in (i + 1)..n {
+                let y2 = points[j][1];
+                if max_y < y2 && y2 <= y1 {
+                    max_y = y2;
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}

solution/3000-3099/3027.Find the Number of Ways to Place People II/README.md

@@ -219,6 +219,37 @@ function numberOfPairs(points: number[][]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn number_of_pairs(mut points: Vec<Vec<i32>>) -> i32 {
+        points.sort_by(|a, b| {
+            if a[0] == b[0] {
+                b[1].cmp(&a[1])
+            } else {
+                a[0].cmp(&b[0])
+            }
+        });
+
+        let n = points.len();
+        let mut ans = 0;
+        for i in 0..n {
+            let y1 = points[i][1];
+            let mut max_y = i32::MIN;
+            for j in (i + 1)..n {
+                let y2 = points[j][1];
+                if max_y < y2 && y2 <= y1 {
+                    max_y = y2;
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}
+```
+
 #### C#
 
 ```cs

solution/3000-3099/3027.Find the Number of Ways to Place People II/README_EN.md

@@ -43,7 +43,7 @@ tags:
 <pre>
 <strong>Input:</strong> points = [[1,1],[2,2],[3,3]]
 <strong>Output:</strong> 0
-<strong>Explanation:</strong> There is no way to place Alice and Bob such that Alice can build a fence with Alice&#39;s position as the upper left corner and Bob&#39;s position as the lower right corner. Hence we return 0. 
+<strong>Explanation:</strong> There is no way to place Alice and Bob such that Alice can build a fence with Alice&#39;s position as the upper left corner and Bob&#39;s position as the lower right corner. Hence we return 0.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -210,6 +210,37 @@ function numberOfPairs(points: number[][]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn number_of_pairs(mut points: Vec<Vec<i32>>) -> i32 {
+        points.sort_by(|a, b| {
+            if a[0] == b[0] {
+                b[1].cmp(&a[1])
+            } else {
+                a[0].cmp(&b[0])
+            }
+        });
+
+        let n = points.len();
+        let mut ans = 0;
+        for i in 0..n {
+            let y1 = points[i][1];
+            let mut max_y = i32::MIN;
+            for j in (i + 1)..n {
+                let y2 = points[j][1];
+                if max_y < y2 && y2 <= y1 {
+                    max_y = y2;
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}
+```
+
 #### C#
 
 ```cs

solution/3000-3099/3027.Find the Number of Ways to Place People II/Solution.rs

@@ -0,0 +1,26 @@
+impl Solution {
+    pub fn number_of_pairs(mut points: Vec<Vec<i32>>) -> i32 {
+        points.sort_by(|a, b| {
+            if a[0] == b[0] {
+                b[1].cmp(&a[1])
+            } else {
+                a[0].cmp(&b[0])
+            }
+        });
+
+        let n = points.len();
+        let mut ans = 0;
+        for i in 0..n {
+            let y1 = points[i][1];
+            let mut max_y = i32::MIN;
+            for j in (i + 1)..n {
+                let y2 = points[j][1];
+                if max_y < y2 && y2 <= y1 {
+                    max_y = y2;
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}