feat: add rust solution to lc problem: No.3111 (#3337)

Author: yanglbme

solution/3100-3199/3111.Minimum Rectangles to Cover Points/README.md

@@ -208,6 +208,26 @@ function minRectanglesToCoverPoints(points: number[][], w: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn min_rectangles_to_cover_points(mut points: Vec<Vec<i32>>, w: i32) -> i32 {
+        points.sort_by(|a, b| a[0].cmp(&b[0]));
+        let mut ans = 0;
+        let mut x1 = -(1 << 30);
+        for p in points {
+            let x = p[0];
+            if x1 + w < x {
+                x1 = x;
+                ans += 1;
+            }
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3100-3199/3111.Minimum Rectangles to Cover Points/README_EN.md

@@ -251,6 +251,26 @@ function minRectanglesToCoverPoints(points: number[][], w: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn min_rectangles_to_cover_points(mut points: Vec<Vec<i32>>, w: i32) -> i32 {
+        points.sort_by(|a, b| a[0].cmp(&b[0]));
+        let mut ans = 0;
+        let mut x1 = -(1 << 30);
+        for p in points {
+            let x = p[0];
+            if x1 + w < x {
+                x1 = x;
+                ans += 1;
+            }
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3100-3199/3111.Minimum Rectangles to Cover Points/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn min_rectangles_to_cover_points(mut points: Vec<Vec<i32>>, w: i32) -> i32 {
+        points.sort_by(|a, b| a[0].cmp(&b[0]));
+        let mut ans = 0;
+        let mut x1 = -(1 << 30);
+        for p in points {
+            let x = p[0];
+            if x1 + w < x {
+                x1 = x;
+                ans += 1;
+            }
+        }
+        ans
+    }
+}