LeetCode 330. Patching Array（贪心）

da_kao_la

于 2019-09-20 09:28:57 发布

阅读量195

点赞数

分类专栏： LeetCode 文章标签： LeetCode Hard Java 贪心

本文链接：https://blog.csdn.net/da_kao_la/article/details/101050403

版权

LeetCode 专栏收录该内容

371 篇文章 0 订阅

订阅专栏

Patching Array

Hard

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:

Input: nums = [1,3], n = 6
Output: 1
Explanation:
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:

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

Input: nums = [1,2,2], n = 5
Output: 0

思路

贪心。miss从1到n遍历，遍历的时候保证[1, miss)之间的数都是可以被组成的。如果nums[i] <= miss，则[miss, miss + nums[i])之间的数也是可以被组成的；如果nums[i] > miss，则[miss, nums[i])之间的数无法被组成，根据贪心的原则取miss补充进nums数组。
题解参考了LeetCode中文网的官方题解，关于贪心算法的正确性的证明可以看官方题解。

代码

class Solution {
    public int minPatches(int[] nums, int n) {
        int i = 0, N = nums.length, ans = 0;
        long miss = 1;
        while (miss <= n) {
            if (i < N && nums[i] <= miss) {
                miss += nums[i++];
            } else {
                miss += miss;
                ++ans;
            }
        }
        return ans;
    }
}