C++ | Leetcode C++题解之第330题按要求补齐数组

题目：

题解：

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