From 0f5a20826a0a531669eb4819e2da67dac30d2f10 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=99=B6=E7=AC=9B?=
 <128707187+catherinexrk@users.noreply.github.com>
Date: Mon, 2 Sep 2024 16:41:19 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00058=E5=8C=BA=E9=97=B4?=
 =?UTF-8?q?=E5=92=8C=20JavaScript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/kamacoder/0058.区间和.md | 49 ++++++++++++++++++++++++++++
 1 file changed, 49 insertions(+)

diff --git a/problems/kamacoder/0058.区间和.md b/problems/kamacoder/0058.区间和.md
index f5ce08dc..5125f5f8 100644
--- a/problems/kamacoder/0058.区间和.md
+++ b/problems/kamacoder/0058.区间和.md
@@ -263,3 +263,52 @@ if __name__ == "__main__":
     main()
 
 ```
+
+###  JavaScript
+
+``` JavaScript
+
+function prefixSum() {
+    const readline = require('readline');
+
+    const rl = readline.createInterface({
+        input: process.stdin,
+        output: process.stdout
+    });
+
+    let inputLines = [];
+    rl.on('line', (line) => {
+        inputLines.push(line.trim());
+    });
+
+    rl.on('close', () => {
+        // 读取项数 n
+        const n = parseInt(inputLines[0]);
+
+        // 使用前缀和，复杂度控制在 O(1)
+        let sum = new Array(n);
+        sum[0] = parseInt(inputLines[1]);
+
+        // 计算前缀和数组
+        for (let i = 1; i < n; i++) {
+            let value = parseInt(inputLines[i + 1]);
+            sum[i] = sum[i - 1] + value;
+        }
+
+        // 处理区间和查询
+        for (let i = n + 1; i < inputLines.length; i++) {
+            let [left, right] = inputLines[i].split(' ').map(Number);
+
+            if (left === 0) {
+                console.log(sum[right]);
+            } else {
+                console.log(sum[right] - sum[left - 1]);
+            }
+        }
+    });
+}
+
+
+```
+
+