Add solution #370

Author: JoshCrozier

README.md

@@ -358,6 +358,7 @@
 367|[Valid Perfect Square](./solutions/0367-valid-perfect-square.js)|Easy|
 368|[Largest Divisible Subset](./solutions/0368-largest-divisible-subset.js)|Medium|
 369|[Plus One Linked List](./solutions/0369-plus-one-linked-list.js)|Medium|
+370|[Range Addition](./solutions/0370-range-addition.js)|Medium|
 371|[Sum of Two Integers](./solutions/0371-sum-of-two-integers.js)|Medium|
 372|[Super Pow](./solutions/0372-super-pow.js)|Medium|
 373|[Find K Pairs with Smallest Sums](./solutions/0373-find-k-pairs-with-smallest-sums.js)|Medium|

solutions/0370-range-addition.js

@@ -0,0 +1,34 @@
+/**
+ * 370. Range Addition
+ * https://leetcode.com/problems/range-addition/
+ * Difficulty: Medium
+ *
+ * You are given an integer length and an array updates where
+ * updates[i] = [startIdxi, endIdxi, inci].
+ *
+ * You have an array arr of length length with all zeros, and you have some operation
+ * to apply on arr. In the ith operation, you should increment all the elements
+ * arr[startIdxi], arr[startIdxi + 1], ..., arr[endIdxi] by inci.
+ *
+ * Return arr after applying all the updates.
+ */
+
+/**
+ * @param {number} length
+ * @param {number[][]} updates
+ * @return {number[]}
+ */
+var getModifiedArray = function(length, updates) {
+  const result = new Array(length).fill(0);
+
+  for (const [start, end, inc] of updates) {
+    result[start] += inc;
+    if (end + 1 < length) result[end + 1] -= inc;
+  }
+
+  for (let i = 1; i < length; i++) {
+    result[i] += result[i - 1];
+  }
+
+  return result;
+};