Leetcode-330.patching Array

/*** All elements of nums, assuming maximum continuous formation [1,sum] when adding an element * will become [1,sum] [element+1,sum+element] Two intervals, the two zones have the following possibilities: * 1 Intersect: Element < sum * 2 continuous: element = sum is the maximum number of elements that remain contiguous and make the added element minimum * 3 absent: element > Sum greater than Sum is discontinuous **/    Private intMinpatches (int[] Nums,intN) {Longsum = 1;//1 is necessary, because to form [1,n] distribution, there must be 1, if nums not, it should be added        intindex= 0; intAdd = 0;  while(Sum <=N) {            if(Index < nums.length && Nums[index] <=sum) {Sum+=Nums[index]; Index++; }            Else{sum+=sum; Add++; }        }        returnadd; }

Leetcode-330.patching Array