feat: add js solution to lc problem: No.1508

Author: rain84

solution/1500-1599/1508.Range Sum of Sorted Subarray Sums/README.md

@@ -63,7 +63,7 @@ tags:
 
 <!-- description:end -->
 
-## 解法
+## 解法: Brute Force
 
 <!-- solution:start -->
 
@@ -185,6 +185,30 @@ function rangeSum(nums: number[], n: number, left: number, right: number): numbe
 }
 ```
 
+#### JavaScript
+
+```js
+function rangeSum(nums, n, left, right) {
+    let arr = Array((n * (n + 1)) / 2).fill(0);
+    const mod = 10 ** 9 + 7;
+
+    for (let i = 0, s = 0, k = 0; i < n; i++, s = 0) {
+        for (let j = i; j < n; j++, k++) {
+            s += nums[j];
+            arr[k] = s;
+        }
+    }
+
+    let ans = 0;
+    arr = arr.sort((a, b) => a - b).slice(left - 1, right);
+    for (const x of arr) {
+        ans += x;
+    }
+
+    return ans % mod;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1500-1599/1508.Range Sum of Sorted Subarray Sums/README_EN.md

@@ -65,7 +65,7 @@ tags:
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Brute Force
 
 <!-- tabs:start -->
 
@@ -179,6 +179,30 @@ function rangeSum(nums: number[], n: number, left: number, right: number): numbe
 }
 ```
 
+#### JavaScript
+
+```js
+function rangeSum(nums, n, left, right) {
+    let arr = Array((n * (n + 1)) / 2).fill(0);
+    const mod = 10 ** 9 + 7;
+
+    for (let i = 0, s = 0, k = 0; i < n; i++, s = 0) {
+        for (let j = i; j < n; j++, k++) {
+            s += nums[j];
+            arr[k] = s;
+        }
+    }
+
+    let ans = 0;
+    arr = arr.sort((a, b) => a - b).slice(left - 1, right);
+    for (const x of arr) {
+        ans += x;
+    }
+
+    return ans % mod;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1500-1599/1508.Range Sum of Sorted Subarray Sums/Solution.js

@@ -0,0 +1,19 @@
+function rangeSum(nums, n, left, right) {
+    let arr = Array((n * (n + 1)) / 2).fill(0);
+    const mod = 10 ** 9 + 7;
+
+    for (let i = 0, s = 0, k = 0; i < n; i++, s = 0) {
+        for (let j = i; j < n; j++, k++) {
+            s += nums[j];
+            arr[k] = s;
+        }
+    }
+
+    let ans = 0;
+    arr = arr.sort((a, b) => a - b).slice(left - 1, right);
+    for (const x of arr) {
+        ans += x;
+    }
+
+    return ans % mod;
+}