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.
题目描述:给定一个递增数组nums,和整数n,想nums中添加数字,使得1~n的数字都可以由nums中部分(或全部)元素相加得到,问最少添加多少个数字
思路:贪心算法;经过思考我们可以知道,如果0~m的数字都可以由数组中的数字相加构成,那么对于数组中任意一个数n,n~n+m都可以由数组中的数字相加得到,因为都可以在之前的和上在加m;因此对于数组中的每一个元素nums[i],我们可以计算出一个到i为止的最大值max,小于max的元素,都可以由i之前的数字相加得到;接下来,如果max>=nums[i] - 1那么max变化为max+nums[i],否则,max变化为max+(max+1),即将max+1这个元素添加到nums数组当中。
代码如下:
class Solution {
public int minPatches(int[] nums, int n) {
long max = 0;
int it = 0, res = 0, len = nums.length;
while(max < n){
while(max < n && it < len && max >= nums[it] - 1){
max += nums[it++];
}
if(max >= n)
break;
max += max + 1;
res++;
}
return res;
}
}