feat: add solutions to lc problem: No.0303

No.0303.Range Sum Query - Immutable

Author: yanglbme

README.md

@@ -41,6 +41,7 @@
 -   [排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md) - 快速排序、归并排序
 -   [字符串相加](/solution/0400-0499/0415.Add%20Strings/README.md) - 高精度加法
 -   [字符串相乘](/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/2100-2199/2132.Stamping%20the%20Grid/README.md) - 二维前缀和、二维差分
 <!-- 排序算法、待补充 -->

README_EN.md

@@ -40,6 +40,7 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h
 -   [Sort an Array](/solution/0900-0999/0912.Sort%20an%20Array/README_EN.md) - Quick Sort, Merge Sort
 -   [Add Strings](/solution/0400-0499/0415.Add%20Strings/README_EN.md) - Addition of large numbers
 -   [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
 -   [ Stamping the Grid](/solution/2100-2199/2132.Stamping%20the%20Grid/README_EN.md) - Prefix sum, Difference array
 

solution/0300-0399/0303.Range Sum Query - Immutable/README.md

@@ -52,6 +52,10 @@ numArray.sumRange(0, 5); // return -3 ((-2) + 0 + 3 + (-5) + 2 + (-1))
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：前缀和**
+
+前缀和计算公式：`s[i + 1] = s[i] + nums[i]`。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -62,19 +66,15 @@ numArray.sumRange(0, 5); // return -3 ((-2) + 0 + 3 + (-5) + 2 + (-1))
 class NumArray:
 
     def __init__(self, nums: List[int]):
-        n = len(nums)
-        self.sums = [0] * (n + 1)
-        for i in range(n):
-            self.sums[i + 1] = nums[i] + self.sums[i]
-
+        self.s = [0] + list(accumulate(nums))
 
-    def sumRange(self, i: int, j: int) -> int:
-        return self.sums[j + 1] - self.sums[i]
+    def sumRange(self, left: int, right: int) -> int:
+        return self.s[right + 1] - self.s[left]
 
 
 # Your NumArray object will be instantiated and called as such:
 # obj = NumArray(nums)
-# param_1 = obj.sumRange(i,j)
+# param_1 = obj.sumRange(left,right)
 ```
 
 ### **Java**
@@ -83,26 +83,77 @@ class NumArray:
 
 ```java
 class NumArray {
-
-    private int[] sums;
+    private int[] s;
 
     public NumArray(int[] nums) {
         int n = nums.length;
-        sums = new int[n + 1];
+        s = new int[n + 1];
         for (int i = 0; i < n; ++i) {
-            sums[i + 1] = nums[i] + sums[i];
+            s[i + 1] = s[i] + nums[i];
         }
     }
-
-    public int sumRange(int i, int j) {
-        return sums[j + 1] - sums[i];
+    
+    public int sumRange(int left, int right) {
+        return s[right + 1] - s[left];
     }
 }
 
 /**
  * Your NumArray object will be instantiated and called as such:
  * NumArray obj = new NumArray(nums);
- * int param_1 = obj.sumRange(i,j);
+ * int param_1 = obj.sumRange(left,right);
+ */
+```
+
+### **C++**
+
+```cpp
+class NumArray {
+public:
+    vector<int> s;
+
+    NumArray(vector<int>& nums) {
+        int n = nums.size();
+        s.resize(n + 1);
+        for (int i = 0; i < n; ++i) s[i + 1] = s[i] + nums[i];
+    }
+    
+    int sumRange(int left, int right) {
+        return s[right + 1] - s[left];
+    }
+};
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * NumArray* obj = new NumArray(nums);
+ * int param_1 = obj->sumRange(left,right);
+ */
+```
+
+### **Go**
+
+```go
+type NumArray struct {
+	s []int
+}
+
+func Constructor(nums []int) NumArray {
+	n := len(nums)
+	s := make([]int, n+1)
+	for i, v := range nums {
+		s[i+1] = s[i] + v
+	}
+	return NumArray{s}
+}
+
+func (this *NumArray) SumRange(left int, right int) int {
+	return this.s[right+1] - this.s[left]
+}
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * obj := Constructor(nums);
+ * param_1 := obj.SumRange(left,right);
  */
 ```
 
@@ -174,6 +225,36 @@ impl NumArray {
  */
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ */
+var NumArray = function (nums) {
+    const n = nums.length;
+    this.s = new Array(n + 1).fill(0);
+    for (let i = 0; i < n; ++i) {
+        this.s[i + 1] = this.s[i] + nums[i];
+    }
+};
+
+/**
+ * @param {number} left
+ * @param {number} right
+ * @return {number}
+ */
+NumArray.prototype.sumRange = function (left, right) {
+    return this.s[right + 1] - this.s[left];
+};
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * var obj = new NumArray(nums)
+ * var param_1 = obj.sumRange(left,right)
+ */
+```
+
 ### **...**
 
 ```

solution/0300-0399/0303.Range Sum Query - Immutable/README_EN.md

@@ -54,45 +54,92 @@ numArray.sumRange(0, 5); // return (-2) + 0 + 3 + (-5) + 2 + (-1) = -3
 class NumArray:
 
     def __init__(self, nums: List[int]):
-        n = len(nums)
-        self.sums = [0] * (n + 1)
-        for i in range(n):
-            self.sums[i + 1] = nums[i] + self.sums[i]
+        self.s = [0] + list(accumulate(nums))
 
-
-    def sumRange(self, i: int, j: int) -> int:
-        return self.sums[j + 1] - self.sums[i]
+    def sumRange(self, left: int, right: int) -> int:
+        return self.s[right + 1] - self.s[left]
 
 
 # Your NumArray object will be instantiated and called as such:
 # obj = NumArray(nums)
-# param_1 = obj.sumRange(i,j)
+# param_1 = obj.sumRange(left,right)
 ```
 
 ### **Java**
 
 ```java
 class NumArray {
-
-    private int[] sums;
+    private int[] s;
 
     public NumArray(int[] nums) {
         int n = nums.length;
-        sums = new int[n + 1];
+        s = new int[n + 1];
         for (int i = 0; i < n; ++i) {
-            sums[i + 1] = nums[i] + sums[i];
+            s[i + 1] = s[i] + nums[i];
         }
     }
-
-    public int sumRange(int i, int j) {
-        return sums[j + 1] - sums[i];
+    
+    public int sumRange(int left, int right) {
+        return s[right + 1] - s[left];
     }
 }
 
 /**
  * Your NumArray object will be instantiated and called as such:
  * NumArray obj = new NumArray(nums);
- * int param_1 = obj.sumRange(i,j);
+ * int param_1 = obj.sumRange(left,right);
+ */
+```
+
+### **C++**
+
+```cpp
+class NumArray {
+public:
+    vector<int> s;
+
+    NumArray(vector<int>& nums) {
+        int n = nums.size();
+        s.resize(n + 1);
+        for (int i = 0; i < n; ++i) s[i + 1] = s[i] + nums[i];
+    }
+    
+    int sumRange(int left, int right) {
+        return s[right + 1] - s[left];
+    }
+};
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * NumArray* obj = new NumArray(nums);
+ * int param_1 = obj->sumRange(left,right);
+ */
+```
+
+### **Go**
+
+```go
+type NumArray struct {
+	s []int
+}
+
+func Constructor(nums []int) NumArray {
+	n := len(nums)
+	s := make([]int, n+1)
+	for i, v := range nums {
+		s[i+1] = s[i] + v
+	}
+	return NumArray{s}
+}
+
+func (this *NumArray) SumRange(left int, right int) int {
+	return this.s[right+1] - this.s[left]
+}
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * obj := Constructor(nums);
+ * param_1 := obj.SumRange(left,right);
  */
 ```
 
@@ -164,6 +211,36 @@ impl NumArray {
  */
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ */
+var NumArray = function (nums) {
+    const n = nums.length;
+    this.s = new Array(n + 1).fill(0);
+    for (let i = 0; i < n; ++i) {
+        this.s[i + 1] = this.s[i] + nums[i];
+    }
+};
+
+/**
+ * @param {number} left
+ * @param {number} right
+ * @return {number}
+ */
+NumArray.prototype.sumRange = function (left, right) {
+    return this.s[right + 1] - this.s[left];
+};
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * var obj = new NumArray(nums)
+ * var param_1 = obj.sumRange(left,right)
+ */
+```
+
 ### **...**
 
 ```

solution/0300-0399/0303.Range Sum Query - Immutable/Solution.cpp

@@ -0,0 +1,20 @@
+class NumArray {
+public:
+    vector<int> s;
+
+    NumArray(vector<int>& nums) {
+        int n = nums.size();
+        s.resize(n + 1);
+        for (int i = 0; i < n; ++i) s[i + 1] = s[i] + nums[i];
+    }
+    
+    int sumRange(int left, int right) {
+        return s[right + 1] - s[left];
+    }
+};
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * NumArray* obj = new NumArray(nums);
+ * int param_1 = obj->sumRange(left,right);
+ */

solution/0300-0399/0303.Range Sum Query - Immutable/Solution.go

@@ -0,0 +1,22 @@
+type NumArray struct {
+	s []int
+}
+
+func Constructor(nums []int) NumArray {
+	n := len(nums)
+	s := make([]int, n+1)
+	for i, v := range nums {
+		s[i+1] = s[i] + v
+	}
+	return NumArray{s}
+}
+
+func (this *NumArray) SumRange(left int, right int) int {
+	return this.s[right+1] - this.s[left]
+}
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * obj := Constructor(nums);
+ * param_1 := obj.SumRange(left,right);
+ */

solution/0300-0399/0303.Range Sum Query - Immutable/Solution.java

@@ -1,22 +1,21 @@
 class NumArray {
-
-    private int[] sums;
+    private int[] s;
 
     public NumArray(int[] nums) {
         int n = nums.length;
-        sums = new int[n + 1];
+        s = new int[n + 1];
         for (int i = 0; i < n; ++i) {
-            sums[i + 1] = nums[i] + sums[i];
+            s[i + 1] = s[i] + nums[i];
         }
     }
 
-    public int sumRange(int i, int j) {
-        return sums[j + 1] - sums[i];
+    public int sumRange(int left, int right) {
+        return s[right + 1] - s[left];
     }
 }
 
 /**
  * Your NumArray object will be instantiated and called as such:
  * NumArray obj = new NumArray(nums);
- * int param_1 = obj.sumRange(i,j);
+ * int param_1 = obj.sumRange(left,right);
  */