C++ Py3 Greedy速解Leetcode 2918 Minimum Equal Sum of Two Arrays After Rep...

C++ Py3 Greedy速解Leetcode 2918  Minimum Equal Sum of Two Arrays After Replacing Zeros

影片展示如何使用C++ STL編寫一個簡短的C++解答； Python程式碼也是按照類似的方式完成的。

[Py3 code請進]

--------

The film shows how to use C++ STL to write a short C++ solution; the Python code is also done in the similar way.

[codes on Leetcode]https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/solutions/6729072/greedy-method-c-98-98-c-100-py3/

[Leetcode playlist]https://www.youtube.com/watch?v=ax-6yooYW9g&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk

class Solution:
    def minSum(self, nums1: List[int], nums2: List[int]) -> int:
        sum1, zero1=sum(nums1), nums1.count(0)
        sum2, zero2=sum(nums2), nums2.count(0)
        if (zero1==0 and sum1<sum2+zero2)or(zero2==0 and sum2<sum1+zero1):
            return -1
        return max(sum1+zero1, sum2+zero2)