<p>You are given two arrays <code>nums1</code> and <code>nums2</code> consisting of positive integers.</p>

<p>You have to replace <strong>all</strong> the <code>0</code>&#39;s in both arrays with <strong>strictly</strong> positive integers such that the sum of elements of both arrays becomes <strong>equal</strong>.</p>

<p>Return <em>the <strong>minimum</strong> equal sum you can obtain, or </em><code>-1</code><em> if it is impossible</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [3,2,0,1,0], nums2 = [6,5,0]
<strong>Output:</strong> 12
<strong>Explanation:</strong> We can replace 0&#39;s in the following way:
- Replace the two 0&#39;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.
</pre>

<p><strong class="example">Example 2:</strong></p>

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

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 10<sup>5</sup></code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 10<sup>6</sup></code></li>
</ul>

'''
for each array, we store num zeros and sum replacing zeros with ones

1. if each arr contains 1 or more zeros -> max(sums)
2. if both arrs contain 0 zeros -> -1 if sums are not equal, else sum
3. if one arr contains 0 zeros -> if sum of arr w/ > 0 zeros <= sum of arr w/ 0 zeros return sum of arr w/ 0 zeros, else -1

O(N), O(1) space
'''



class Solution:
    def minSum(self, nums1: List[int], nums2: List[int]) -> int:
        zero_counts = [0, 0]
        min_sums = [0, 0]

        for num in nums1:
            if num == 0:
                zero_counts[0] += 1
                min_sums[0] += 1
            else:
                min_sums[0] += num
        for num in nums2:
            if num == 0:
                zero_counts[1] += 1
                min_sums[1] += 1
            else:
                min_sums[1] += num
        
        if zero_counts[0] > 0 and zero_counts[1] > 0:
            return max(min_sums)
        elif zero_counts[0] == 0 and zero_counts[1] == 0:
            return min_sums[0] if min_sums[0] == min_sums[1] else -1
        else:
            arr_with_zeros_sum = min_sums[0] if zero_counts[0] > 0 else min_sums[1]
            arr_without_zeros_sum = min_sums[0] if zero_counts[0] == 0 else min_sums[1]

            return arr_without_zeros_sum if arr_with_zeros_sum <= arr_without_zeros_sum else -1
862