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
.
笔者英文不太好,看翻译理解了半天。其实就是要我们在已有的元素基础上,我们最少需要再增加多少个元素,才能要能够组成1-n所有数。
讲一下大致的思路。大致上是一个指数累加的过程。首先我们重1开始遍历N个数。我们先找已有的元素中有没有小于或者等于我们当前所累加的元素。有就加入到我们的累加值中,没有的话我们就要新加入一个值(就是题目中药增加的元素)。假如我们有元素[1,2]那我们就能组成1,2,3,。那我们还要继续累加到4时,我们再添加一个元素[1,2,4]这个时候我们最大可以满足组成1-7中任意一个元素。然后以这个思路一直向后累加。
注意:leetcoede中有个测试用例是给了n=2147483647。这个时候注意一下越界。int型取值范围是-2147483648-2147483647。
下面贴我的代码(C语言):
int minPatches(int* nums, int numsSize, int n)
{
int i, t = 0,j = 0, nowval = 0;
for (i = 1 ; i <= n; ++i)
{
if (j < numsSize && nums[j] <= i)
{
nowval = nowval + nums[j++];
i = nowval;
}
else
{
nowval = nowval + i;
t++;
if(i > n/2) //这里有可能数组越界
{
break;
}
i = nowval;
}
}
return t;
}