题目:
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.
Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.
先假设最初提供的数字集为空,则为了生成[1, 1]我们需要添加1。
为了生成[1, 2]我们是添加1还是添加2呢?
显然是添加2好,因为添加2可以生成[1, 3],范围更大。
所以,按照这个规律,我们添加4,生成[1, 7],依次类推。
现在考虑数字集提供的数字,假设我们现在可以生成[1, k],使用了nums[0]~nums[i - 1]及s个添加的数字。
在保持s个添加数字的前提下,我们想让范围最大,则需要加入nums[i]。
而nums[i]只有在小于等于k + 1时添加才能扩充生成范围。
否则,在添加s个数字的情况下,[1, k]已经是最大的范围了。
所以我们尽可能的使用nums[i]去扩充生成范围,不得已时再添加数字。
class Solution {
public:
int minPatches(vector<int>& nums, int n) {
sort(nums.begin(), nums.end());
long long mx = 0;
long long nn = n;
int ans = 0;
for (int i = 0; i < nums.size() || mx < nn; i++) {
if (mx >= nn) break;
if (i < nums.size()) {
if (mx + 1 < nums[i]) mx = mx * 2 + 1, ans++, i--;
else mx += nums[i];
}
else mx = mx * 2 + 1, ans++, i--;
}
return ans;
}
};