leetcode

0 class Solution {

1 public:

2 int minPatches(const vector<int> &nums, const int n) const {

3 long long sum = 0;

4 int res = 0, i = 0;

5

6 while (sum < n) {

7 if (i < size(nums) && nums[i] <= sum + 1)

8 sum += nums[i++];

9 else

10 sum += sum + 1, res++;

11 }

12

13 return res;

14 }

15 };