Add solution #330

Author: JoshCrozier

README.md

@@ -266,6 +266,7 @@
 327|[Count of Range Sum](./0327-count-of-range-sum.js)|Hard|
 328|[Odd Even Linked List](./0328-odd-even-linked-list.js)|Medium|
 329|[Longest Increasing Path in a Matrix](./0329-longest-increasing-path-in-a-matrix.js)|Hard|
+330|[Patching Array](./0330-patching-array.js)|Hard|
 331|[Verify Preorder Serialization of a Binary Tree](./0331-verify-preorder-serialization-of-a-binary-tree.js)|Medium|
 334|[Increasing Triplet Subsequence](./0334-increasing-triplet-subsequence.js)|Medium|
 337|[House Robber III](./0337-house-robber-iii.js)|Medium|

solutions/0330-patching-array.js

@@ -0,0 +1,31 @@
+/**
+ * 330. Patching Array
+ * https://leetcode.com/problems/patching-array/
+ * Difficulty: Hard
+ *
+ * Given a sorted integer array nums and an integer n, add/patch elements to the array such
+ * that any number in the range [1, n] inclusive can be formed by the sum of some elements
+ * in the array.
+ *
+ * Return the minimum number of patches required.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} n
+ * @return {number}
+ */
+var minPatches = function(nums, n) {
+  let result = 0;
+
+  for (let i = 0, k = 1; k <= n;) {
+    if (i < nums.length && nums[i] <= k) {
+      k += nums[i++];
+    } else {
+      k += k;
+      result++;
+    }
+  }
+
+  return result;
+};