messy but working python solution
Intuition\n Describe your first thoughts on how to solve this problem. \ntake care of the edge cases \n\n# Approach\n Describe your approach to solving the prob
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\ntake care of the edge cases \n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n        print(nums1, nums2)\n        first, second = sum(nums1), sum(nums2)\n        if first != second and 0 not in nums1 and 0 not in nums2:\n            return -1\n        print(first, second)\n        if 0 in nums1 and 0 not in nums2 or 0 in nums2 and 0 not in nums1:\n            if 0 not in nums2 and 0 in nums1 and second > first and nums1.count(0) <= abs(second - first):\n                return second\n            if 0 in nums2 and 0 not in nums1 and first > second and nums2.count(0) <= abs(first - second):\n                return first\n            return -1\n        zcone, zctwo = nums1.count(0), nums2.count(0)\n        print(first, second)\n        if zcone > zctwo and first > second:\n            return max(first, second) + (1 * nums1.count(0))\n        else:\n            a, b = first + (1 * nums1.count(0)), second + (1 * nums2.count(0))\n            print(a, b)\n            return max(a, b)\n            return max(first, second) + (1 * nums2.count(0))\n\n```
['Python3']