Algorithm
Problem Name: 330. Patching Array
Problem Link: https://leetcode.com/problems/patching-array/
Given a sorted integer array nums and an integer n, add/patch elements to the array such that any number in the 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:
Input: nums = [1,3], n = 6 Output: 1 Explanation: 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:
Input: nums = [1,5,10], n = 20 Output: 2 Explanation: The two patches can be [2, 4].
Example 3:
Input: nums = [1,2,2], n = 5 Output: 0
Constraints:
1 <= nums.length <= 10001 <= nums[i] <= 104numsis sorted in ascending order.1 <= n <= 231 - 1
Code Examples
#1 Code Example with Javascript Programming
Code -
Javascript Programming
const minPatches = function(nums, n) {
let answer = 0
for (let i = 0, next = 1; next < = n; ) {
if (i >= nums.length || nums[i] > next) {
answer++
next *= 2
} else next += nums[i++]
}
return answer
}
Input
nums = [1,3], n = 6
Output
1
#2 Code Example with Python Programming
Code -
Python Programming
class Solution:
def minPatches(self, nums, n):
miss, added, i = 1, 0, 0
while miss <= n:
if i < len(nums) and nums[i] <= miss:
miss += nums[i]
i += 1
else:
miss *= 2
added += 1
return added
Input
nums = [1,3], n = 6
Output
1