LC 2918. Minimum Equal Sum of Two Arrays After Replacing Zeros

Author: raul-sauco

README.md

@@ -785,6 +785,7 @@ to the solution in this repository.
 | [2864. Maximum Odd Binary Number][lc2864]                                                     | 🟢 Easy    | [![rust](res/rs.png)][lc2864rs]                                                                       |
 | [2870. Minimum Number of Operations to Make Array Empty][lc2870]                              | 🟠 Medium  | [![rust](res/rs.png)][lc2870rs]                                                                       |
 | [2914. Minimum Number of Changes to Make Binary String Beautiful][lc2914]                     | 🟠 Medium  | [![rust](res/rs.png)][lc2914rs]                                                                       |
+| [2918. Minimum Equal Sum of Two Arrays After Replacing Zeros][lc2918]                         | 🟠 Medium  | [![rust](res/rs.png)][lc2918rs]                                                                       |
 | [2938. Separate Black and White Balls][lc2938]                                                | 🟠 Medium  | [![rust](res/rs.png)][lc2938rs]                                                                       |
 | [2958. Length of Longest Subarray With at Most K Frequency][lc2958]                           | 🟠 Medium  | [![rust](res/rs.png)][lc2958rs]                                                                       |
 | [2962. Count Subarrays Where Max Element Appears at Least K Times][lc2962]                    | 🟠 Medium  | [![rust](res/rs.png)][lc2962rs]                                                                       |
@@ -2524,6 +2525,8 @@ to the solution in this repository.
 [lc2870rs]: leetcode/minimum-number-of-operations-to-make-array-empty.rs
 [lc2914]: https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful/
 [lc2914rs]: leetcode/minimum-number-of-changes-to-make-binary-string-beautiful.rs
+[lc2918]: https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/
+[lc2918rs]: leetcode/minimum-equal-sum-of-two-arrays-after-replacing-zeros.rs
 [lc2938]: https://leetcode.com/problems/separate-black-and-white-balls/
 [lc2938rs]: leetcode/separate-black-and-white-balls.rs
 [lc2958]: https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency/

leetcode/minimum-equal-sum-of-two-arrays-after-replacing-zeros.rs

@@ -0,0 +1,68 @@
+// 2918. Minimum Equal Sum of Two Arrays After Replacing Zeros
+// 🟠 Medium
+//
+// https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/
+//
+// Tags: Array - Greedy
+
+struct Solution;
+impl Solution {
+    /// Compute the minimum and maximum we can get from each array, return the minimum value common
+    /// to both intervals or -1 if there is no common value.
+    ///
+    /// Time complexity: O(n+m)
+    /// Space complexity: O(1)
+    ///
+    /// Runtime 16 ms Beats 60%
+    /// Memory 3.82 MB Beats %
+    pub fn min_sum(nums1: Vec<i32>, nums2: Vec<i32>) -> i64 {
+        fn min_max(nums: &Vec<i32>) -> (i64, i64) {
+            let (s, z) = nums.iter().fold((0, 0), |(s, c), &x| {
+                (s + x as i64, c + if x == 0 { 1 } else { 0 })
+            });
+            let min = s + z as i64;
+            let max = if z > 0 { i64::MAX } else { min };
+            (min, max)
+        }
+        let (a, b) = (min_max(&nums1), min_max(&nums2));
+        let (start, end) = (a.0.max(b.0), a.1.min(b.1));
+        if start > end {
+            -1
+        } else {
+            start
+        }
+    }
+}
+
+// Tests.
+fn main() {
+    let tests = [
+        (vec![3, 2, 0, 1, 0], vec![6, 5, 0], 12),
+        (vec![2, 0, 2, 0], vec![1, 4], -1),
+    ];
+    println!("\n\x1b[92m» Running {} tests...\x1b[0m", tests.len());
+    let mut success = 0;
+    for (i, t) in tests.iter().enumerate() {
+        let res = Solution::min_sum(t.0.clone(), t.1.clone());
+        if res == t.2 {
+            success += 1;
+            println!("\x1b[92m✔\x1b[95m Test {} passed!\x1b[0m", i);
+        } else {
+            println!(
+                "\x1b[31mx\x1b[95m Test {} failed expected: {:?} but got {}!!\x1b[0m",
+                i, t.2, res
+            );
+        }
+    }
+    println!();
+    if success == tests.len() {
+        println!("\x1b[30;42m✔ All tests passed!\x1b[0m")
+    } else if success == 0 {
+        println!("\x1b[31mx \x1b[41;37mAll tests failed!\x1b[0m")
+    } else {
+        println!(
+            "\x1b[31mx\x1b[95m {} tests failed!\x1b[0m",
+            tests.len() - success
+        )
+    }
+}