Follow the hints! - Part 4

Not a hard problem but it requires a bit of focus on the details of the calculations. The hints really helped here. Code is down below, cheers, ACC.

Minimum Equal Sum of Two Arrays After Replacing Zeros - LeetCode

2918. Minimum Equal Sum of Two Arrays After Replacing Zeros

Medium

You are given two arrays nums1 and nums2 consisting of positive integers.

You have to replace all the 0's in both arrays with strictly positive integers such that the sum of elements of both arrays becomes equal.

Return the minimum equal sum you can obtain, or -1 if it is impossible.

 

Example 1:

Input: nums1 = [3,2,0,1,0], nums2 = [6,5,0]
Output: 12
Explanation: We can replace 0's in the following way:
- Replace the two 0's in nums1 with the values 2 and 4. The resulting array is nums1 = [3,2,2,1,4].
- Replace the 0 in nums2 with the value 1. The resulting array is nums2 = [6,5,1].
Both arrays have an equal sum of 12. It can be shown that it is the minimum sum we can obtain.

Example 2:

Input: nums1 = [2,0,2,0], nums2 = [1,4]
Output: -1
Explanation: It is impossible to make the sum of both arrays equal.

 

Constraints:

• 1 <= nums1.length, nums2.length <= 105
• 0 <= nums1[i], nums2[i] <= 106

Accepted

12,241

Submissions

40,451

public long MinSum(int[] nums1, int[] nums2)
{
    long sum1 = 0;
    foreach (int n in nums1) sum1 += n;
    long sum2 = 0;
    foreach (int n in nums2) sum2 += n;
    long zeroes1 = (long)nums1.Where(i => i == 0).Count();
    long zeroes2 = (long)nums2.Where(i => i == 0).Count();

    if (sum1 > sum2 && (zeroes2 == 0 || (sum2 + zeroes2 > sum1 && zeroes1 == 0))) return -1L;
    if (sum2 > sum1 && (zeroes1 == 0 || (sum1 + zeroes1 > sum2 && zeroes2 == 0))) return -1L;
    if (sum1 == sum2 && ((zeroes1 > 0 && zeroes2 == 0) || (zeroes2 > 0 && zeroes1 == 0))) return -1L;
    return Math.Max(sum1 + zeroes1, sum2 + zeroes2);
}