Add problem 3452: Sum of Good Numbers

Author: EFanZh

src/lib.rs

@@ -2237,6 +2237,7 @@ pub mod problem_3442_maximum_difference_between_even_and_odd_frequency_i;
 pub mod problem_3443_maximum_manhattan_distance_after_k_changes;
 pub mod problem_3446_sort_matrix_by_diagonals;
 pub mod problem_3447_assign_elements_to_groups_with_constraints;
+pub mod problem_3452_sum_of_good_numbers;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_3452_sum_of_good_numbers/iterative.rs

@@ -0,0 +1,35 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn sum_of_good_numbers(nums: Vec<i32>, k: i32) -> i32 {
+        let k = k.cast_unsigned() as usize;
+
+        nums.iter()
+            .enumerate()
+            .filter_map(|(i, &num)| {
+                [i.wrapping_sub(k), i + k]
+                    .iter()
+                    .all(|&j| nums.get(j).is_none_or(|&other| num > other))
+                    .then_some(num)
+            })
+            .sum()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn sum_of_good_numbers(nums: Vec<i32>, k: i32) -> i32 {
+        Self::sum_of_good_numbers(nums, k)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3452_sum_of_good_numbers/mod.rs

@@ -0,0 +1,18 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn sum_of_good_numbers(nums: Vec<i32>, k: i32) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [((&[1, 3, 2, 1, 5, 4] as &[_], 2), 12), ((&[2, 1], 1), 2)];
+
+        for ((nums, k), expected) in test_cases {
+            assert_eq!(S::sum_of_good_numbers(nums.to_vec(), k), expected);
+        }
+    }
+}