给定一个非递减数组，以及n，求最小添加几个元素能保证通过元素组合覆盖到1至n任意数

//  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.
public static int minPatches(int[] nums, int n) {
        long miss = 1;
        int added = 0, i = 0;
        while (miss <= n) {
            if (i < nums.length && nums[i] <= miss) {
                miss += nums[i++];
            } else {
                added++;
                miss += miss;
            }
        }
        return added;
    }