330. Patching Array

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.

https://leetcode.com/discuss/82822/solution-explanation

class Solution {
public:
    int minPatches(vector<int>& nums, int n) {
        if(n <=0 ) return 0;
        long miss = 1,i = 0;   //if miss is int , it can overflow
        int result = 0;
        while(miss <= n){
            if(i < nums.size() && nums[i] <= miss){
                miss += nums[i++];
            } else {
                miss += miss;
                result++;
            }
        }
        return result;
    }
};

假设miss是我们目前能够得到[0,n]之间缺失的最小值，所以我们可以确定[0,miss) 之间的所有数我们都可以得到，那么当数组的数字num <= miss，我们就可以得到[0,miss+num]区间的所有数字了，如果不存在这样的num，我们就需要添加一个数字了，这个添加的数字最好就是miss本身，这样就可以得到[0,miss+miss)区间的所有数字了。