Patching Array: Min Patches Required For Range Coverage
Minimize patches required to cover range [1,n] with array nums using greedy algorithm. Initialize miss=1, loop until miss>n: if current num covers miss, add it; else patch miss & double range.
330. Patching Array Difficulty: Hard Topics: Array, Greedy 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,...