Leetcode Patching Array

Leetcode Patching Array

源代码

class Solution {
public:
int minPatches(vector<int>& nums, int n) {
int index= 0;
int res=0;
long long  curSum=1;
while(curSum<=n)
{
if(index<nums.size()&& nums[index]<=curSum)
{
curSum+=nums[index++];
}
else
{
res++;
curSum*=2;
}
}
return res;
}
};