Add problem 2974: Minimum Number Game

Author: EFanZh

src/lib.rs

@@ -2035,6 +2035,7 @@ pub mod problem_2965_find_missing_and_repeated_values;
 pub mod problem_2966_divide_array_into_arrays_with_max_difference;
 pub mod problem_2970_count_the_number_of_incremovable_subarrays_i;
 pub mod problem_2972_count_the_number_of_incremovable_subarrays_ii;
+pub mod problem_2974_minimum_number_game;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2974_minimum_number_game/mod.rs

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

src/problem_2974_minimum_number_game/sorting.rs

@@ -0,0 +1,33 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn number_game(nums: Vec<i32>) -> Vec<i32> {
+        let mut nums = nums;
+
+        nums.sort_unstable_by_key(|num| num.cast_unsigned());
+
+        for chunk in nums.chunks_exact_mut(2) {
+            chunk.swap(0, 1);
+        }
+
+        nums
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn number_game(nums: Vec<i32>) -> Vec<i32> {
+        Self::number_game(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}