330

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