Add problem 3698: Split Array With Minimum Difference

Author: EFanZh

src/lib.rs

@@ -2306,6 +2306,7 @@ pub mod problem_3688_bitwise_or_of_even_numbers_in_an_array;
 pub mod problem_3689_maximum_total_subarray_value_i;
 pub mod problem_3692_majority_frequency_characters;
 pub mod problem_3697_compute_decimal_representation;
+pub mod problem_3698_split_array_with_minimum_difference;
 pub mod problem_3701_compute_alternating_sum;
 pub mod problem_3707_equal_score_substrings;
 pub mod problem_3708_longest_fibonacci_subarray;

src/problem_3698_split_array_with_minimum_difference/iterative.rs

@@ -0,0 +1,60 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn split_array(nums: Vec<i32>) -> i64 {
+        let nums = nums.into_iter().map(i32::cast_unsigned).collect::<Vec<_>>();
+        let mut prev_1 = 0_u64;
+        let mut candidate = 0_u64;
+        let mut iter = nums.iter().copied();
+
+        let mut prev_2 = u64::from(loop {
+            if let Some(num) = iter.next() {
+                if (prev_1 as u32) < num {
+                    prev_1 = u64::from(num);
+                    candidate += prev_1;
+                } else {
+                    break num;
+                }
+            } else {
+                return (candidate - prev_1).abs_diff(prev_1).cast_signed();
+            }
+        });
+
+        candidate = candidate.wrapping_sub(prev_2);
+
+        for num in iter {
+            if num < prev_2 as u32 {
+                prev_2 = u64::from(num);
+                candidate = candidate.wrapping_sub(prev_2);
+            } else {
+                return -1;
+            }
+        }
+
+        let mut result = candidate.cast_signed().unsigned_abs();
+
+        if prev_1 != prev_2 {
+            result = result.min(candidate.wrapping_sub(prev_1 * 2).cast_signed().unsigned_abs());
+        }
+
+        result.cast_signed()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn split_array(nums: Vec<i32>) -> i64 {
+        Self::split_array(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3698_split_array_with_minimum_difference/mod.rs

@@ -0,0 +1,23 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn split_array(nums: Vec<i32>) -> i64;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (&[1, 3, 2] as &[_], 2),
+            (&[1, 2, 4, 3], 4),
+            (&[3, 1, 2], -1),
+            (&[29, 30, 28, 27, 21, 18], 35),
+        ];
+
+        for (nums, expected) in test_cases {
+            assert_eq!(S::split_array(nums.to_vec()), expected);
+        }
+    }
+}