✨ range sum of sorted subarray sums

Author: tangweikun

CATEGORY.md

@@ -25,6 +25,9 @@
 - 9.链表
   148
 
+- 10.回溯算法
+  491
+
 * 字符串
 
 * 排序
@@ -40,8 +43,6 @@
 
 * 二叉搜索树
 
-- 回溯算法
-
 - 位运算
 
 * 并查集

src/1508-range-sum-of-sorted-subarray-sums/index.js

@@ -0,0 +1,27 @@
+/**
+ * @param {number[]} nums
+ * @param {number} n
+ * @param {number} left
+ * @param {number} right
+ * @return {number}
+ */
+var rangeSum = function (nums, n, left, right) {
+  const res = [];
+  let index = 0;
+
+  for (let i = 0; i < nums.length; i++) {
+    let sum = 0;
+    for (let j = i; j < nums.length; j++) {
+      sum += nums[j];
+      res[index] = sum;
+      index++;
+    }
+  }
+
+  res.sort((x, y) => x - y);
+
+  return (
+    res.slice(left - 1, right).reduce((acc, x) => acc + x, 0) %
+    (Math.pow(10, 9) + 7)
+  );
+};