Add problem 2639: Find the Width of Columns of a Grid

Author: EFanZh

src/lib.rs

@@ -1929,6 +1929,7 @@ pub mod problem_2602_minimum_operations_to_make_all_array_elements_equal;
 pub mod problem_2609_find_the_longest_balanced_substring_of_a_binary_string;
 pub mod problem_2610_convert_an_array_into_a_2d_array_with_conditions;
 pub mod problem_2614_prime_in_diagonal;
+pub mod problem_2639_find_the_width_of_columns_of_a_grid;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2639_find_the_width_of_columns_of_a_grid/iterative.rs

@@ -0,0 +1,45 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn find_column_width(grid: Vec<Vec<i32>>) -> Vec<i32> {
+        let columns = grid.first().map_or(0, Vec::len);
+
+        (0..columns)
+            .map(|i| {
+                grid.iter().fold(0, |max, row| {
+                    let value = row[i];
+
+                    max.max('block: {
+                        let (abs, extra) = match value.cmp(&0) {
+                            Ordering::Less => (-value, 2),
+                            Ordering::Equal => break 'block 1,
+                            Ordering::Greater => (value, 1),
+                        };
+
+                        (abs as u32).ilog10() + extra
+                    })
+                }) as _
+            })
+            .collect()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn find_column_width(grid: Vec<Vec<i32>>) -> Vec<i32> {
+        Self::find_column_width(grid)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2639_find_the_width_of_columns_of_a_grid/mod.rs

@@ -0,0 +1,31 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn find_column_width(grid: Vec<Vec<i32>>) -> Vec<i32>;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+    use crate::test_utilities::Matrix;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (&[[1], [22], [333]] as &dyn Matrix<_>, &[3] as &[_]),
+            (&[[-15, 1, 3], [15, 7, 12], [5, 6, -2]], &[3, 1, 2]),
+            (
+                &[
+                    [-4, 0, -1, 3, 9, 8, 6],
+                    [-2, 5, -5, -7, -2, -6, 7],
+                    [4, -4, 1, 7, 0, 6, 8],
+                    [-6, 2, -5, 0, 9, 1, -6],
+                ],
+                &[2, 2, 2, 2, 2, 2, 2],
+            ),
+        ];
+
+        for (grid, expected) in test_cases {
+            assert_eq!(S::find_column_width(grid.to_vec()), expected);
+        }
+    }
+}