题目:
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.
类似于五高三模里面的一个趣味题,给多少盆花才能满足国王的要求那个题。
考虑当前能组成的最大的数,下一个数如果数组里有,就更新能组成的最大数,如果有下一个数小于当前最大值,也同样更新最大值,需要添加的数是在下一个数不是当前最大数的下一个的时候,比如当前最大是5,如果下一个是6或者等于,就更新最大值,如果下一个是8,就需要添加一个7,最大值更新为6+7=13,知道最大值大于n为止。注意使用long,会超限。
class Solution {
public:
int minPatches(vector<int>& nums, int n) {
long re = 0;
long sum = 0;
long i = 0;
while(sum<n){
if(i < nums.size()&&nums[i]<=sum+1){
sum = sum + nums[i];
i++;
} else {
re++;
sum = sum +sum+1;
}
}
return re;
}
};