Difficulty:Hard
Descriptions
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
.
Solution
思路
参照Leetcode Discuss中最高票回答:
让miss
代表目前数组nums
能构成连续整数的上限[1, miss)
。如果nums
中有整数nums[i] <= miss
,就能把它加进去,形成更大的连续整数范围[1, miss + nums[i])
。如果nums
中没有符合要求的数,就需要插入一个数,当这个数的值等于miss
时,能保证插入数的数目最小。
例如,输入nums = [1, 2, 4, 13, 43] , n = 100
。用[1, 2, 4]
能构成连续整数[1, 8)
,而接下来的[13]
太大了,无法构出8
。于是需要插入8
,连续整数范围就被扩大为[1, 16)
。
再看是否需要插入16
?不需要。因为能用[1, 2, 13]
构造出来了。现在用13
和数组nums
中其他的数能构出更大范围的连续整数,[1, 29)
。
以此类推,nums
给的43
太大,不能构出29
,所以需要插入29
,范围扩大为[1, 58)
了。接下来43
就能派上用场,范围扩大为[1, 101)
,完成。
代码
Accepted.
class Solution {
public:
int minPatches(vector<int>& nums, int n) {
long miss = 1; // miss表示数组nums目前能构成连续整数的范围为[1, miss)
int i = 0, add = 0;
while (miss <= n) {
if (i < nums.size() && nums[i] <= miss) {
miss += nums[i++];
}
else {
miss += miss;
add++;
}
}
return add;
}
};