26/5/25

Author: Lam Thanh Phat

Python/2918. Minimum Equal Sum of Two Arrays After Replacing Zeros.py

@@ -0,0 +1,50 @@
+# 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.
+
+
+class Solution(object):
+    def minSum(self, nums1, nums2):
+        """
+        :type nums1: List[int]
+        :type nums2: List[int]
+        :rtype: int
+        """
+        sum_nums1, sum_nums2 = 0, 0
+        n_zeros_nums1, n_zeros_nums2 = 0, 0
+        for num in nums1:
+            sum_nums1 += num
+            if num == 0:
+                sum_nums1 += 1
+                n_zeros_nums1 += 1
+        
+        for num in nums2:
+            sum_nums2 += num
+            if num == 0:
+                sum_nums2 += 1
+                n_zeros_nums2 += 1
+    
+
+        if (n_zeros_nums1 == 0 and sum_nums1 < sum_nums2) \
+        or (n_zeros_nums2 == 0 and sum_nums1 > sum_nums2):
+            return -1
+        
+        return max(sum_nums1, sum_nums2)