Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in 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:
nums = [1, 3]
, n = 6
Return 1.
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:
nums = [1, 5, 10]
, n = 20
Return 2.
The two patches can be [2, 4]
.
Example 3:
nums = [1, 2, 2]
, n = 5
Return 0.
假設數組當前可以表示的范圍為[1, total)
內的所有數字,那麼向數組中添加元素add
可以將表示范圍擴充至[1, total + add)
,其中add≤total
。當且僅當add=total
時取到范圍上限[1, 2 * total)
。
add
的元素時,則利用數組中的元素。 若沒有,則添加新元素add
。
//Runtime: 1 ms
public class Solution {
public int minPatches(int[] nums, int n) {
long miss = 1;
int add = 0;
int i = 0;
while (miss <= n) {
if (i < nums.length && nums[i] <= miss){
miss += nums[i++];
} else {
miss += miss;
add += 1;
}
}
return add;
}
}