LeetCode 330 Patching Array

    // refer: https://www.hrwhisper.me/leetcode-patching-array/
    public int minPatches(int[] nums, int n) {
        int i = 0;
        int cnt = 0;
        long knownSum = 1;
        while(knownSum <= n) {
            if(i < nums.length && nums[i] <= knownSum) {
                knownSum += nums[i];
                i++;
            } else {
                knownSum *= 2;
                cnt++;
            }
        }
        
        return cnt;
    }