LeetCode *** 330. Patching Array

最新推荐文章于 2024-08-25 09:24:55 发布

原创最新推荐文章于 2024-08-25 09:24:55 发布 · 254 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

212 篇文章

订阅专栏

本文介绍了一种算法，用于确定给定已排序正整数数组和目标范围时所需的最小补丁数量，使得数组中元素的任意组合能覆盖该范围内的所有数值。通过三个示例详细解释了算法的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some elements in the array. Return the minimum number of patches required.

Example 1:
nums = [1, 3], n = 6
Return 1.

Combinations of nums are [1], [3], [1,3], which form possible sums of: 1, 3, 4.
Now if we add/patch 2 to nums, the combinations are: [1], [2], [3], [1,3], [2,3], [1,2,3].
Possible sums are 1, 2, 3, 4, 5, 6, which now covers the range [1, 6].
So we only need 1 patch.

Example 2:
nums = [1, 5, 10], n = 20
Return 2.
The two patches can be [2, 4].

Example 3:
nums = [1, 2, 2], n = 5
Return 0.

分析：

。

代码：

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