Add problem 2500: Delete Greatest Value in Each Row

Author: EFanZh

src/lib.rs

@@ -1870,6 +1870,7 @@ pub mod problem_2492_minimum_score_of_a_path_between_two_cities;
 pub mod problem_2496_maximum_value_of_a_string_in_an_array;
 pub mod problem_2497_maximum_star_sum_of_a_graph;
 pub mod problem_2498_frog_jump_ii;
+pub mod problem_2500_delete_greatest_value_in_each_row;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2500_delete_greatest_value_in_each_row/iterative.rs

@@ -0,0 +1,33 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn delete_greatest_value(grid: Vec<Vec<i32>>) -> i32 {
+        let mut grid = grid;
+
+        for row in &mut grid {
+            row.sort_unstable();
+        }
+
+        let columns = grid.first().map_or(0, Vec::len);
+
+        (0..columns).fold(0, |sum, i| sum + grid.iter().fold(i32::MIN, |max, row| max.max(row[i])))
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn delete_greatest_value(grid: Vec<Vec<i32>>) -> i32 {
+        Self::delete_greatest_value(grid)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2500_delete_greatest_value_in_each_row/mod.rs

@@ -0,0 +1,19 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn delete_greatest_value(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 = [(&[[1, 2, 4], [3, 3, 1]] as &dyn Matrix<_>, 8), (&[[10]], 10)];
+
+        for (grid, expected) in test_cases {
+            assert_eq!(S::delete_greatest_value(grid.to_vec()), expected);
+        }
+    }
+}