Simple Intuitive Python Solution
Intuition\nAll zeros must be updated to a value of at least 1. If we know how many zeros each array has, along with their sum, we should be able to figure out t
# Intuition\nAll zeros must be updated to a value of at least 1. If we know how many zeros each array has, along with their sum, we should be able to figure out the minimum sum for each array. With the minimum sum for each array, we can simply return the larger of the two (except for the edge case of no zeros present in the lesser array).\n\n# Approach\nFirst capture all pertinent fields: zero counts and sums.\n\nNext, return -1 if it is not possible to make the sum of both arrays equal. This is true if there are no zeros in one array and its sum is less than and the other array\'s minimum value (its sum + zero count).\n\nNow, simply return the max between the two minimum sums.\n\n# Complexity\n- Time complexity:\n$$O(n)$$\n\n- Space complexity:\n$$O(1)$$\n\n# Code\n```python3 []\nclass Solution:\n    def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n        zer1 = nums1.count(0)\n        zer2 = nums2.count(0)\n        sum1 = sum(nums1)\n        sum2 = sum(nums2)\n\n        if (zer1 == 0 and sum1 < sum2+zer2) or (zer2 == 0 and sum2 < sum1+zer1):\n            return -1\n        \n        return max(zer1+sum1, zer2+sum2)\n        \n```
['Greedy', 'Python3']