Class Solution
-
- All Implemented Interfaces:
public final class Solution
330 - Patching Array\.
Hard
Given a sorted integer array
nums
and an integern
, add/patch elements to the array such that any number in the range[1, n]
inclusive can be formed by the sum of some elements in the array.Return the minimum number of patches required.
Example 1:
Input: nums = 1,3, n = 6
Output: 1 Explanation: Combinations of nums are 1, 3, 1,3, which form possible sums of: 1, 3, 4. Now if we add/patch 2 to nums, the combinations are: 1, 2, 3, 1,3, 2,3, 1,2,3. Possible sums are 1, 2, 3, 4, 5, 6, which now covers the range 1, 6. So we only need 1 patch.
Example 2:
Input: nums = 1,5,10, n = 20
Output: 2 Explanation: The two patches can be 2, 4.
Example 3:
Input: nums = 1,2,2, n = 5
Output: 0
Constraints:
1 <= nums.length <= 1000
<code>1 <= numsi<= 10<sup>4</sup></code>
nums
is sorted in ascending order.<code>1 <= n <= 2<sup>31</sup> - 1</code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Integer
minPatches(IntArray nums, Integer n)
-
-
Method Detail
-
minPatches
final Integer minPatches(IntArray nums, Integer n)
-
-
-
-