feat: update solutions to leetcode problem: No.0303

Author: yanglbme

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

@@ -33,15 +33,51 @@ sumRange(0, 5) -&gt; -3</pre>
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+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]
+
+
+    def sumRange(self, i: int, j: int) -> int:
+        return self.sums[j + 1] - self.sums[i]
+
+
+# Your NumArray object will be instantiated and called as such:
+# obj = NumArray(nums)
+# param_1 = obj.sumRange(i,j)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class NumArray {
+
+    private int[] sums;
+
+    public NumArray(int[] nums) {
+        int n = nums.length;
+        sums = new int[n + 1];
+        for (int i = 0; i < n; ++i) {
+            sums[i + 1] = nums[i] + sums[i];
+        }
+    }
+
+    public int sumRange(int i, int j) {
+        return sums[j + 1] - sums[i];
+    }
+}
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * NumArray obj = new NumArray(nums);
+ * int param_1 = obj.sumRange(i,j);
+ */
 ```
 
 ### **...**

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

@@ -43,13 +43,49 @@ sumRange(0, 5) -> -3
 ### **Python3**
 
 ```python
+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]
+
+
+    def sumRange(self, i: int, j: int) -> int:
+        return self.sums[j + 1] - self.sums[i]
+
+
+# Your NumArray object will be instantiated and called as such:
+# obj = NumArray(nums)
+# param_1 = obj.sumRange(i,j)
 ```
 
 ### **Java**
 
 ```java
-
+class NumArray {
+
+    private int[] sums;
+
+    public NumArray(int[] nums) {
+        int n = nums.length;
+        sums = new int[n + 1];
+        for (int i = 0; i < n; ++i) {
+            sums[i + 1] = nums[i] + sums[i];
+        }
+    }
+
+    public int sumRange(int i, int j) {
+        return sums[j + 1] - sums[i];
+    }
+}
+
+/**
+ * Your NumArray object will be instantiated and called as such:
+ * NumArray obj = new NumArray(nums);
+ * int param_1 = obj.sumRange(i,j);
+ */
 ```
 
 ### **...**

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

@@ -1,22 +1,18 @@
 class NumArray {
 
-	private int[] nums;
-	private int[] sums;
+    private int[] sums;
 
-	public NumArray(int[] tmp) {
-		this.nums = Arrays.copyOf(tmp, tmp.length);
-		sums = new int[nums.length + 1];
-		for (int i = 0; i < nums.length; i++) {
-			sums[i + 1] += nums[i] + sums[i];
-		}
-	}
-
-	public int sumRange(int i, int j) {
-		if (i < 0 || j > nums.length || i > j) {
-			return 0;
-		}
-		return sums[j + 1] - sums[i];
-	}
+    public NumArray(int[] nums) {
+        int n = nums.length;
+        sums = new int[n + 1];
+        for (int i = 0; i < n; ++i) {
+            sums[i + 1] = nums[i] + sums[i];
+        }
+    }
+    
+    public int sumRange(int i, int j) {
+        return sums[j + 1] - sums[i];
+    }
 }
 
 /**

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

@@ -0,0 +1,16 @@
+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]
+
+
+    def sumRange(self, i: int, j: int) -> int:
+        return self.sums[j + 1] - self.sums[i]
+
+
+# Your NumArray object will be instantiated and called as such:
+# obj = NumArray(nums)
+# param_1 = obj.sumRange(i,j)