feat: add solutions to lc problem: No.0370

No.0370.Range Addition

Author: yanglbme

README.md

@@ -43,6 +43,7 @@
 -   [字符串相乘](/solution/0000-0099/0043.Multiply%20Strings/README.md) - 高精度乘法
 -   [区域和检索 - 数组不可变](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md) - 前缀和
 -   [二维区域和检索 - 矩阵不可变](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md) - 二维前缀和
+-   [区间加法](/solution/0300-0399/0370.Range%20Addition/README.md) - 前缀和、差分
 -   [ 用邮票贴满网格图](/solution/2100-2199/2132.Stamping%20the%20Grid/README.md) - 二维前缀和、二维差分
 <!-- 排序算法、待补充 -->
 

README_EN.md

@@ -42,6 +42,7 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h
 -   [Multiply Strings](/solution/0000-0099/0043.Multiply%20Strings/README_EN.md) - Multiply large numbers
 -   [Range Sum Query - Immutable](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README_EN.md) - Prefix sum
 -   [Range Sum Query 2D - Immutable](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README_EN.md) - Prefix sum
+-   [Range Addition](/solution/0300-0399/0370.Range%20Addition/README_EN.md) - Prefix sum, Difference array
 -   [ Stamping the Grid](/solution/2100-2199/2132.Stamping%20the%20Grid/README_EN.md) - Prefix sum, Difference array
 
 ### 2. Search

solution/0300-0399/0370.Range Addition/README.md

@@ -39,6 +39,12 @@
 
 **方法一：差分数组**
 
+设 d 为差分数组。
+
+给区间 [l, r] 中的每一个数加上 c，即 `d[l] += c, d[r + 1] -= c`。
+
+对 d 求前缀和，即可得到操作后的数组。
+
 时间复杂度 O(n)。
 
 **方法二：树状数组 + 差分思想**
@@ -68,9 +74,7 @@ class Solution:
             delta[start] += inc
             if end + 1 < length:
                 delta[end + 1] -= inc
-        for i in range(1, length):
-            delta[i] += delta[i - 1]
-        return delta
+        return list(accumulate(delta))
 ```
 
 树状数组：
@@ -318,6 +322,29 @@ func getModifiedArray(length int, updates [][]int) []int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number} length
+ * @param {number[][]} updates
+ * @return {number[]}
+ */
+var getModifiedArray = function (length, updates) {
+    let delta = new Array(length).fill(0);
+    for (let [start, end, inc] of updates) {
+        delta[start] += inc;
+        if (end + 1 < length) {
+            delta[end + 1] -= inc;
+        }
+    }
+    for (let i = 1; i < length; ++i) {
+        delta[i] += delta[i - 1];
+    }
+    return delta;
+};
+```
+
 ### **...**
 
 ```

solution/0300-0399/0370.Range Addition/README_EN.md

@@ -49,9 +49,7 @@ class Solution:
             delta[start] += inc
             if end + 1 < length:
                 delta[end + 1] -= inc
-        for i in range(1, length):
-            delta[i] += delta[i - 1]
-        return delta
+        return list(accumulate(delta))
 ```
 
 ```python
@@ -283,6 +281,29 @@ func getModifiedArray(length int, updates [][]int) []int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number} length
+ * @param {number[][]} updates
+ * @return {number[]}
+ */
+var getModifiedArray = function (length, updates) {
+    let delta = new Array(length).fill(0);
+    for (let [start, end, inc] of updates) {
+        delta[start] += inc;
+        if (end + 1 < length) {
+            delta[end + 1] -= inc;
+        }
+    }
+    for (let i = 1; i < length; ++i) {
+        delta[i] += delta[i - 1];
+    }
+    return delta;
+};
+```
+
 ### **...**
 
 ```

solution/0300-0399/0370.Range Addition/Solution.js

@@ -0,0 +1,18 @@
+/**
+ * @param {number} length
+ * @param {number[][]} updates
+ * @return {number[]}
+ */
+var getModifiedArray = function (length, updates) {
+    let delta = new Array(length).fill(0);
+    for (let [start, end, inc] of updates) {
+        delta[start] += inc;
+        if (end + 1 < length) {
+            delta[end + 1] -= inc;
+        }
+    }
+    for (let i = 1; i < length; ++i) {
+        delta[i] += delta[i - 1];
+    }
+    return delta;
+};

solution/0300-0399/0370.Range Addition/Solution.py

@@ -5,6 +5,4 @@ def getModifiedArray(self, length: int, updates: List[List[int]]) -> List[int]:
             delta[start] += inc
             if end + 1 < length:
                 delta[end + 1] -= inc
-        for i in range(1, length):
-            delta[i] += delta[i - 1]
-        return delta
+        return list(accumulate(delta))