Package g2901_3000.s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2918 - Minimum Equal Sum of Two Arrays After Replacing Zeros.

    Medium

    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.

    Constraints:

    • <code>1 <= nums1.length, nums2.length <= 10<sup>5</sup></code>

    • <code>0 <= nums1i, nums2i<= 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Long minSum(IntArray nums1, IntArray nums2)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait