#2513

Minimize the Maximum of Two Arrays

expert · 1110 · lc medium +32 · verified · 32.2% accepted · 523 likes · top 10%

Description

Fill two initially empty arrays with positive integers satisfying these rules: arr1 must hold uniqueCnt1 distinct values none divisible by divisor1; arr2 must hold uniqueCnt2 distinct values none divisible by divisor2; no value may appear in both arrays. Return the minimum possible maximum integer across both arrays.

Example 1:

Input: divisor1 = 2, divisor2 = 7, uniqueCnt1 = 1, uniqueCnt2 = 3

Output: 4

Explanation:

We can distribute the first 4 natural numbers into arr1 and arr2.

arr1 = [1] and arr2 = [2,3,4].

We can see that both arrays satisfy all the conditions.

Since the maximum value is 4, we return it.

Example 2:

Input: divisor1 = 3, divisor2 = 5, uniqueCnt1 = 2, uniqueCnt2 = 1

Output: 3

Explanation:

Here arr1 = [1,2], and arr2 = [3] satisfy all conditions.

Since the maximum value is 3, we return it.

Example 3:

Input: divisor1 = 2, divisor2 = 4, uniqueCnt1 = 8, uniqueCnt2 = 2

Output: 15

Explanation:

Here, the final possible arrays can be arr1 = [1,3,5,7,9,11,13,15], and arr2 = [2,6].

It can be shown that it is not possible to obtain a lower maximum satisfying all conditions.

Code

1

2

3

class Solution:
    def minimizeSet(self, divisor1: int, divisor2: int, uniqueCnt1: int, uniqueCnt2: int) -> int:

class Solution:
    def minimizeSet(self, divisor1: int, divisor2: int, uniqueCnt1: int, uniqueCnt2: int) -> int: