feat: add solutions to lc problems: No.0303, 1603

- No.0303.Range Sum Query - Immutable
- No.1603.Design Parking System

Author: YangFong

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

@@ -158,6 +158,36 @@ func (this *NumArray) SumRange(left int, right int) int {
  */
 ```
 
+### **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)
+ */
+```
+
 ### **TypeScript**
 
 ```ts
@@ -219,7 +249,7 @@ impl NumArray {
 
 ```rust
 struct NumArray {
-    nums: Vec<i32>
+    sums: Vec<i32>,
 }
 
 
@@ -231,17 +261,15 @@ impl NumArray {
 
     fn new(mut nums: Vec<i32>) -> Self {
         let n = nums.len();
-        for i in 1..n {
-            nums[i] += nums[i - 1];
-        }
-        Self {
-            nums
+        let mut sums = vec![0; n + 1];
+        for i in 0..n {
+            sums[i + 1] = sums[i] + nums[i];
         }
+        Self { sums }
     }
 
     fn sum_range(&self, left: i32, right: i32) -> i32 {
-        let (left, right) = (left as usize, right as usize);
-        self.nums[right] - if left == 0 { 0 } else { self.nums[left - 1] }
+        self.sums[(right + 1) as usize] - self.sums[left as usize]
     }
 }
 
@@ -252,34 +280,40 @@ impl NumArray {
  */
 ```
 
-### **JavaScript**
+### **C**
 
-```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];
+```c
+typedef struct {
+    int *sums;
+} NumArray;
+
+
+NumArray *numArrayCreate(int *nums, int numsSize) {
+    int *sums = malloc(sizeof(int) * (numsSize + 1));
+    memset(sums, 0, numsSize + 1);
+    for (int i = 0; i < numsSize; i++) {
+        sums[i + 1] = sums[i] + nums[i];
     }
-};
+    NumArray *res = malloc(sizeof(NumArray));
+    res->sums = sums;
+    return res;
+}
 
-/**
- * @param {number} left
- * @param {number} right
- * @return {number}
- */
-NumArray.prototype.sumRange = function (left, right) {
-    return this.s[right + 1] - this.s[left];
-};
+int numArraySumRange(NumArray *obj, int left, int right) {
+    return obj->sums[right + 1] - obj->sums[left];
+}
+
+void numArrayFree(NumArray *obj) {
+    free(obj);
+}
 
 /**
- * Your NumArray object will be instantiated and called as such:
- * var obj = new NumArray(nums)
- * var param_1 = obj.sumRange(left,right)
- */
+ * Your NumArray struct will be instantiated and called as such:
+ * NumArray* obj = numArrayCreate(nums, numsSize);
+ * int param_1 = numArraySumRange(obj, left, right);
+
+ * numArrayFree(obj);
+*/
 ```
 
 ### **...**

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

@@ -142,6 +142,36 @@ func (this *NumArray) SumRange(left int, right int) int {
  */
 ```
 
+### **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)
+ */
+```
+
 ### **TypeScript**
 
 ```ts
@@ -203,7 +233,7 @@ impl NumArray {
 
 ```rust
 struct NumArray {
-    nums: Vec<i32>
+    sums: Vec<i32>,
 }
 
 
@@ -215,17 +245,15 @@ impl NumArray {
 
     fn new(mut nums: Vec<i32>) -> Self {
         let n = nums.len();
-        for i in 1..n {
-            nums[i] += nums[i - 1];
-        }
-        Self {
-            nums
+        let mut sums = vec![0; n + 1];
+        for i in 0..n {
+            sums[i + 1] = sums[i] + nums[i];
         }
+        Self { sums }
     }
 
     fn sum_range(&self, left: i32, right: i32) -> i32 {
-        let (left, right) = (left as usize, right as usize);
-        self.nums[right] - if left == 0 { 0 } else { self.nums[left - 1] }
+        self.sums[(right + 1) as usize] - self.sums[left as usize]
     }
 }
 
@@ -236,34 +264,40 @@ impl NumArray {
  */
 ```
 
-### **JavaScript**
+### **C**
 
-```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];
+```c
+typedef struct {
+    int *sums;
+} NumArray;
+
+
+NumArray *numArrayCreate(int *nums, int numsSize) {
+    int *sums = malloc(sizeof(int) * (numsSize + 1));
+    memset(sums, 0, numsSize + 1);
+    for (int i = 0; i < numsSize; i++) {
+        sums[i + 1] = sums[i] + nums[i];
     }
-};
+    NumArray *res = malloc(sizeof(NumArray));
+    res->sums = sums;
+    return res;
+}
 
-/**
- * @param {number} left
- * @param {number} right
- * @return {number}
- */
-NumArray.prototype.sumRange = function (left, right) {
-    return this.s[right + 1] - this.s[left];
-};
+int numArraySumRange(NumArray *obj, int left, int right) {
+    return obj->sums[right + 1] - obj->sums[left];
+}
+
+void numArrayFree(NumArray *obj) {
+    free(obj);
+}
 
 /**
- * Your NumArray object will be instantiated and called as such:
- * var obj = new NumArray(nums)
- * var param_1 = obj.sumRange(left,right)
- */
+ * Your NumArray struct will be instantiated and called as such:
+ * NumArray* obj = numArrayCreate(nums, numsSize);
+ * int param_1 = numArraySumRange(obj, left, right);
+
+ * numArrayFree(obj);
+*/
 ```
 
 ### **...**

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

@@ -0,0 +1,31 @@
+typedef struct {
+    int *sums;
+} NumArray;
+
+
+NumArray *numArrayCreate(int *nums, int numsSize) {
+    int *sums = malloc(sizeof(int) * (numsSize + 1));
+    memset(sums, 0, numsSize + 1);
+    for (int i = 0; i < numsSize; i++) {
+        sums[i + 1] = sums[i] + nums[i];
+    }
+    NumArray *res = malloc(sizeof(NumArray));
+    res->sums = sums;
+    return res;
+}
+
+int numArraySumRange(NumArray *obj, int left, int right) {
+    return obj->sums[right + 1] - obj->sums[left];
+}
+
+void numArrayFree(NumArray *obj) {
+    free(obj);
+}
+
+/**
+ * Your NumArray struct will be instantiated and called as such:
+ * NumArray* obj = numArrayCreate(nums, numsSize);
+ * int param_1 = numArraySumRange(obj, left, right);
+
+ * numArrayFree(obj);
+*/

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

@@ -1,5 +1,5 @@
 struct NumArray {
-    nums: Vec<i32>
+    sums: Vec<i32>,
 }
 
 
@@ -8,25 +8,22 @@ struct NumArray {
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl NumArray {
-
     fn new(mut nums: Vec<i32>) -> Self {
         let n = nums.len();
-        for i in 1..n {
-            nums[i] += nums[i - 1];
-        }
-        Self {
-            nums
+        let mut sums = vec![0; n + 1];
+        for i in 0..n {
+            sums[i + 1] = sums[i] + nums[i];
         }
+        Self { sums }
     }
 
     fn sum_range(&self, left: i32, right: i32) -> i32 {
-        let (left, right) = (left as usize, right as usize);
-        self.nums[right] - if left == 0 { 0 } else { self.nums[left - 1] }
+        self.sums[(right + 1) as usize] - self.sums[left as usize]
     }
 }
 
 /**
  * Your NumArray object will be instantiated and called as such:
  * let obj = NumArray::new(nums);
  * let ret_1: i32 = obj.sum_range(left, right);
- */
+ */