330. Patching Array
Difficulty: Hard
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.
思路
用maxnum表示数组目前可取的最大值,则已知的连续和为[0,maxnum],则:
nums[i] <= maxnum + 1,更新可达范围为[0,maxnum + nums[i]];
nums[i] > maxnum + 1,添加maxnum + 1进数组才能达到最大的连续取值范围,所以可到范围更新为[1,maxnum *2 + 1]。
代码
[C++]
class Solution {
public:
int minPatches(vector<int>& nums, int n) {
long maxnum = 0;
int minp = 0;
int i = 0;
while (maxnum < n) {
if (i < nums.size() && nums[i] <= maxnum + 1) {
maxnum += nums[i];
i++;
}
else {
maxnum = 2 * maxnum + 1;
minp++;
}
}
return minp;
}
};