问题描述
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.
思路
题目大意是:给出一个有序的非负整数数组nums和一个整数n,问最少添加多少个数到数组中,使得[1, n]中的每一个整数可以通过数组中的若干个数的和得到。
思路如下:因为1肯定存在于数组中,假设sum表示目前可以得到[1, sum)区间内的所有非负整数,那么,
1. 当nums[index] <= sum时,更新可得到数的范围:[1, sum+ nums[index] );
2. 当nums[index] > sum时,无法表示所有[1, sum+ nums[index] )区间的数。所以需要将sum作为新元素添加进数组中,才能使范围增大。范围更新为[1, sum*2),结果+1。
3. 当index >= nums.size()时,数组中所有的数仍不能得到[1, n]范围的数,需要将sum作为新元素添加进数组中,范围更新为[1, sum*2),结果+1。
循环直至sum大于n,因为[1, sum) ⊇ [1, n],所以得到结果。
代码
class Solution {
public:
int minPatches(vector<int>& nums, int n) {
long sum = 1;
int result = 0;
int index = 0;
while (sum <= n) {
if (index < nums.size() && nums[index] <= sum) {
sum += nums[index++];
} else {
sum *= 2;
result++;
}
}
return result;
}
};