LeetCode 330 Patching Array All In One

LeetCode 330 Patching Array All In One

330. Patching Array

solutions

function minPatches(nums: number[], n: number): number {
  let patch = 1;
  let count = 0;
  let i = 0;
  while (patch <= n) {
    if (nums[i] <= patch && i < nums.length) {
      patch += nums[i];
      i++;
    } else {
      patch += patch;
      count++;
    }
  }
  return count;
};

https://leetcode.com/problems/patching-array/description/?envType=daily-question&envId=2024-06-16

demos

(🐞 反爬虫测试！打击盗版⚠️）如果你看到这个信息, 说明这是一篇剽窃的文章，请访问 https://www.cnblogs.com/xgqfrms/ 查看原创文章！

refs

---

---

©xgqfrms 2012-2021

www.cnblogs.com/xgqfrms 发布文章使用：只允许注册用户才可以访问！

原创文章，版权所有©️xgqfrms, 禁止转载 🈲️，侵权必究⚠️！

---