Add problem 3111: Minimum Rectangles to Cover Points

Author: EFanZh

src/lib.rs

@@ -2092,6 +2092,7 @@ pub mod problem_3105_longest_strictly_increasing_or_strictly_decreasing_subarray
 pub mod problem_3106_lexicographically_smallest_string_after_operations_with_constraint;
 pub mod problem_3107_minimum_operations_to_make_median_of_array_equal_to_k;
 pub mod problem_3110_score_of_a_string;
+pub mod problem_3111_minimum_rectangles_to_cover_points;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3111_minimum_rectangles_to_cover_points/greedy.rs

@@ -0,0 +1,39 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn min_rectangles_to_cover_points(points: Vec<Vec<i32>>, w: i32) -> i32 {
+        let mut points = points.into_iter().map(|point| point[0]).collect::<Vec<_>>();
+
+        points.sort_unstable();
+
+        let mut result = 0;
+        let mut covered = i32::MIN;
+
+        for &point in &points {
+            if point > covered {
+                result += 1;
+                covered = point + w;
+            }
+        }
+
+        result
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn min_rectangles_to_cover_points(points: Vec<Vec<i32>>, w: i32) -> i32 {
+        Self::min_rectangles_to_cover_points(points, w)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3111_minimum_rectangles_to_cover_points/mod.rs

@@ -0,0 +1,25 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn min_rectangles_to_cover_points(points: Vec<Vec<i32>>, w: i32) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            ((&[[2, 1], [1, 0], [1, 4], [1, 8], [3, 5], [4, 6]] as &[_], 1), 2),
+            ((&[[0, 0], [1, 1], [2, 2], [3, 3], [4, 4], [5, 5], [6, 6]], 2), 3),
+            ((&[[2, 3], [1, 2]], 0), 2),
+        ];
+
+        for ((points, w), expected) in test_cases {
+            assert_eq!(
+                S::min_rectangles_to_cover_points(points.iter().map(Vec::from).collect(), w),
+                expected,
+            );
+        }
+    }
+}