@@ -0,0 +1,45 @@
+/**
+* Given a sorted positive integer array nums and an integer n, add/
+* 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 es 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/ 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 .
+*
+* Example 2:
+* Input: nums = [1,5,10], n = 20
+* Output: 2
+* Explanation: The two es can be [2, 4].
+*
+* Example 3:
+* Input: nums = [1,2,2], n = 5
+* Output: 0
+*/
+
+/**
+* https://leetcode.com/problems/ing-array/discuss/280183/Detailed-Explanation-with-Example
+*/
+public class ingArray330 {
+public int mines(int[] nums, int n) {
+long  = 0;
+int count = 0;
+int index = 0;
+while ( < n) {
+if (index < nums.length &&  + 1 >= nums[index]) {
+ += nums[index];
+index++;
+} else {
+ += ( + 1);
+count++;
+}
+}
+return count;
+}
+}