Add solution #1526

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,347 LeetCode solutions in JavaScript
+# 1,348 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1166,6 +1166,7 @@
 1523|[Count Odd Numbers in an Interval Range](./solutions/1523-count-odd-numbers-in-an-interval-range.js)|Easy|
 1524|[Number of Sub-arrays With Odd Sum](./solutions/1524-number-of-sub-arrays-with-odd-sum.js)|Medium|
 1525|[Number of Good Ways to Split a String](./solutions/1525-number-of-good-ways-to-split-a-string.js)|Medium|
+1526|[Minimum Number of Increments on Subarrays to Form a Target Array](./solutions/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.js)|Hard|
 1528|[Shuffle String](./solutions/1528-shuffle-string.js)|Easy|
 1534|[Count Good Triplets](./solutions/1534-count-good-triplets.js)|Easy|
 1535|[Find the Winner of an Array Game](./solutions/1535-find-the-winner-of-an-array-game.js)|Medium|

solutions/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.js

@@ -0,0 +1,28 @@
+/**
+ * 1526. Minimum Number of Increments on Subarrays to Form a Target Array
+ * https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/
+ * Difficulty: Hard
+ *
+ * You are given an integer array target. You have an integer array initial of the same size as
+ * target with all elements initially zeros.
+ *
+ * In one operation you can choose any subarray from initial and increment each value by one.
+ *
+ * Return the minimum number of operations to form a target array from initial.
+ *
+ * The test cases are generated so that the answer fits in a 32-bit integer.
+ */
+
+/**
+ * @param {number[]} target
+ * @return {number}
+ */
+var minNumberOperations = function(target) {
+  let operations = target[0];
+  for (let i = 1; i < target.length; i++) {
+    if (target[i] > target[i - 1]) {
+      operations += target[i] - target[i - 1];
+    }
+  }
+  return operations;
+};