Class Solution
-
- All Implemented Interfaces:
public final class Solution
1655 - Distribute Repeating Integers.
Hard
You are given an array of
n
integers,nums
, where there are at most50
unique values in the array. You are also given an array ofm
customer order quantities,quantity
, wherequantity[i]
is the amount of integers the <code>i<sup>th</sup></code> customer ordered. Determine if it is possible to distributenums
such that:The <code>i<sup>th</sup></code> customer gets exactly
quantity[i]
integers,The integers the <code>i<sup>th</sup></code> customer gets are all equal , and
Every customer is satisfied.
Return
true
if it is possible to distributenums
according to the above conditions.Example 1:
Input: nums = 1,2,3,4, quantity = 2
Output: false
Explanation: The 0<sup>th</sup> customer cannot be given two different integers.
Example 2:
Input: nums = 1,2,3,3, quantity = 2
Output: true
Explanation: The 0<sup>th</sup> customer is given 3,3. The integers 1,2 are not used.
Example 3:
Input: nums = 1,1,2,2, quantity = 2,2
Output: true
Explanation: The 0<sup>th</sup> customer is given 1,1, and the 1st customer is given 2,2.
Constraints:
n == nums.length
<code>1 <= n <= 10<sup>5</sup></code>
1 <= nums[i] <= 1000
m == quantity.length
1 <= m <= 10
<code>1 <= quantityi<= 10<sup>5</sup></code>
There are at most
50
unique values innums
.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Boolean
canDistribute(IntArray nums, IntArray quantity)
-
-
Method Detail
-
canDistribute
final Boolean canDistribute(IntArray nums, IntArray quantity)
-
-
-
-