Add problem 3195: Find the Minimum Area to Cover All Ones I

Author: EFanZh

src/lib.rs

@@ -2131,6 +2131,7 @@ pub mod problem_3190_find_minimum_operations_to_make_all_elements_divisible_by_t
 pub mod problem_3191_minimum_operations_to_make_binary_array_elements_equal_to_one_i;
 pub mod problem_3192_minimum_operations_to_make_binary_array_elements_equal_to_one_ii;
 pub mod problem_3194_minimum_average_of_smallest_and_largest_elements;
+pub mod problem_3195_find_the_minimum_area_to_cover_all_ones_i;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3195_find_the_minimum_area_to_cover_all_ones_i/greedy.rs

@@ -0,0 +1,45 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+use std::convert;
+
+impl Solution {
+    pub fn minimum_area(grid: Vec<Vec<i32>>) -> i32 {
+        let mut min_row = u32::MAX;
+        let mut max_row = 0;
+        let mut min_column = u32::MAX;
+        let mut max_column = 0;
+
+        (0..).zip(grid).for_each(|(y, row)| {
+            let mut iter = row.iter().map(|&num| num != 0);
+
+            if let Some(last_column) = iter.rposition(convert::identity) {
+                let first_column = iter.position(convert::identity).unwrap_or(last_column);
+
+                min_row = min_row.min(y);
+                max_row = y;
+                min_column = min_column.min(first_column as _);
+                max_column = max_column.max(last_column as _);
+            }
+        });
+
+        ((max_column - min_column + 1) * (max_row - min_row + 1)).cast_signed()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn minimum_area(grid: Vec<Vec<i32>>) -> i32 {
+        Self::minimum_area(grid)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3195_find_the_minimum_area_to_cover_all_ones_i/mod.rs

@@ -0,0 +1,19 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn minimum_area(grid: Vec<Vec<i32>>) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+    use crate::test_utilities::Matrix;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [(&[[0, 1, 0], [1, 0, 1]] as &dyn Matrix<_>, 6), (&[[1, 0], [0, 0]], 1)];
+
+        for (grid, expected) in test_cases {
+            assert_eq!(S::minimum_area(grid.to_vec()), expected);
+        }
+    }
+}