Add problem 3131: Find the Integer Added to Array I

Author: EFanZh

src/lib.rs

@@ -2098,6 +2098,7 @@ pub mod problem_3115_maximum_prime_difference;
 pub mod problem_3120_count_the_number_of_special_characters_i;
 pub mod problem_3121_count_the_number_of_special_characters_ii;
 pub mod problem_3127_make_a_square_with_the_same_color;
+pub mod problem_3131_find_the_integer_added_to_array_i;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3131_find_the_integer_added_to_array_i/greedy.rs

@@ -0,0 +1,29 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn added_integer(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        fn min(nums: &[i32]) -> i32 {
+            nums.iter().copied().fold(i32::MAX, i32::min)
+        }
+
+        min(&nums2) - min(&nums1)
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn added_integer(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
+        Self::added_integer(nums1, nums2)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3131_find_the_integer_added_to_array_i/mod.rs

@@ -0,0 +1,22 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn added_integer(nums1: Vec<i32>, nums2: Vec<i32>) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            ((&[2, 6, 4] as &[_], &[9, 7, 5] as &[_]), 3),
+            ((&[10], &[5]), -5),
+            ((&[1, 1, 1, 1], &[1, 1, 1, 1]), 0),
+        ];
+
+        for ((nums1, nums2), expected) in test_cases {
+            assert_eq!(S::added_integer(nums1.to_vec(), nums2.to_vec()), expected);
+        }
+    }
+}