Merge branch 'main' into add-solutions-to-lc-problem-3410

Author: Speccy-Rom

.github/workflows/deploy.yml

@@ -100,15 +100,18 @@ jobs:
 
           echo "Cloning docs branch ..."
           git clone --depth 1 --branch docs "https://x-access-token:${GH_TOKEN}@github.com/${GH_REPO}.git" docs-cache
-          cp "$CACHE_FILE" docs-cache/
 
           cd docs-cache
+          git checkout --orphan docs
+          git rm -rf .
+          cp "../$CACHE_FILE" ./
+
           git config user.name github-actions[bot]
           git config user.email 41898282+github-actions[bot]@users.noreply.github.com
 
           git add .git-committers-cache.json
           git commit -m "chore: update committer cache [skip ci]" || echo "No changes to commit"
-          git push origin docs
+          git push --force origin docs
 
       - name: Upload artifact
         uses: actions/upload-pages-artifact@v3

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/README.md

@@ -127,7 +127,7 @@ func sumZero(n int) []int {
 
 ```ts
 function sumZero(n: number): number[] {
-    const ans = new Array(n).fill(0);
+    const ans: number[] = Array(n).fill(0);
     for (let i = 1, j = 0; i <= n / 2; ++i) {
         ans[j++] = i;
         ans[j++] = -i;
@@ -136,6 +136,24 @@ function sumZero(n: number): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn sum_zero(n: i32) -> Vec<i32> {
+        let mut ans = vec![0; n as usize];
+        let mut j = 0;
+        for i in 1..=n / 2 {
+            ans[j] = i;
+            j += 1;
+            ans[j] = -i;
+            j += 1;
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
@@ -215,6 +233,21 @@ function sumZero(n: number): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn sum_zero(n: i32) -> Vec<i32> {
+        let mut ans = vec![0; n as usize];
+        for i in 1..n {
+            ans[i as usize] = i;
+        }
+        ans[0] = -(n * (n - 1) / 2);
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/README_EN.md

@@ -57,7 +57,11 @@ tags:
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Construction
+
+We can start from $1$ and alternately add positive and negative numbers to the result array. We repeat this process $\frac{n}{2}$ times. If $n$ is odd, we add $0$ to the result array at the end.
+
+The time complexity is $O(n)$, where $n$ is the given integer. Ignoring the space used for the answer, the space complexity is $O(1)$.
 
 <!-- tabs:start -->
 
@@ -124,7 +128,7 @@ func sumZero(n int) []int {
 
 ```ts
 function sumZero(n: number): number[] {
-    const ans = new Array(n).fill(0);
+    const ans: number[] = Array(n).fill(0);
     for (let i = 1, j = 0; i <= n / 2; ++i) {
         ans[j++] = i;
         ans[j++] = -i;
@@ -133,13 +137,35 @@ function sumZero(n: number): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn sum_zero(n: i32) -> Vec<i32> {
+        let mut ans = vec![0; n as usize];
+        let mut j = 0;
+        for i in 1..=n / 2 {
+            ans[j] = i;
+            j += 1;
+            ans[j] = -i;
+            j += 1;
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
 
 <!-- solution:start -->
 
-### Solution 2
+### Solution 2: Construction + Mathematics
+
+We can also add all integers from $1$ to $n-1$ to the result array, and finally add the opposite of the sum of the first $n-1$ integers, which is $-\frac{n(n-1)}{2}$, to the result array.
+
+The time complexity is $O(n)$, where $n$ is the given integer. Ignoring the space used for the answer, the space complexity is $O(1)$.
 
 <!-- tabs:start -->
 
@@ -208,6 +234,21 @@ function sumZero(n: number): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn sum_zero(n: i32) -> Vec<i32> {
+        let mut ans = vec![0; n as usize];
+        for i in 1..n {
+            ans[i as usize] = i;
+        }
+        ans[0] = -(n * (n - 1) / 2);
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+    pub fn sum_zero(n: i32) -> Vec<i32> {
+        let mut ans = vec![0; n as usize];
+        let mut j = 0;
+        for i in 1..=n / 2 {
+            ans[j] = i;
+            j += 1;
+            ans[j] = -i;
+            j += 1;
+        }
+        ans
+    }
+}

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/Solution.ts

@@ -1,5 +1,5 @@
 function sumZero(n: number): number[] {
-    const ans = new Array(n).fill(0);
+    const ans: number[] = Array(n).fill(0);
     for (let i = 1, j = 0; i <= n / 2; ++i) {
         ans[j++] = i;
         ans[j++] = -i;

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/Solution2.java

@@ -7,4 +7,4 @@ public int[] sumZero(int n) {
         ans[0] = -(n * (n - 1) / 2);
         return ans;
     }
-}
+}

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/Solution2.rs

@@ -0,0 +1,10 @@
+impl Solution {
+    pub fn sum_zero(n: i32) -> Vec<i32> {
+        let mut ans = vec![0; n as usize];
+        for i in 1..n {
+            ans[i as usize] = i;
+        }
+        ans[0] = -(n * (n - 1) / 2);
+        ans
+    }
+}

solution/3400-3499/3484.Design Spreadsheet/README.md

@@ -274,6 +274,44 @@ class Spreadsheet {
  */
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashMap;
+
+struct Spreadsheet {
+    d: HashMap<String, i32>,
+}
+
+impl Spreadsheet {
+    fn new(_rows: i32) -> Self {
+        Spreadsheet {
+            d: HashMap::new(),
+        }
+    }
+
+    fn set_cell(&mut self, cell: String, value: i32) {
+        self.d.insert(cell, value);
+    }
+
+    fn reset_cell(&mut self, cell: String) {
+        self.d.remove(&cell);
+    }
+
+    fn get_value(&self, formula: String) -> i32 {
+        let mut ans = 0;
+        for cell in formula[1..].split('+') {
+            if cell.chars().next().unwrap().is_ascii_digit() {
+                ans += cell.parse::<i32>().unwrap();
+            } else {
+                ans += *self.d.get(cell).unwrap_or(&0);
+            }
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3400-3499/3484.Design Spreadsheet/README_EN.md

@@ -272,6 +272,44 @@ class Spreadsheet {
  */
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashMap;
+
+struct Spreadsheet {
+    d: HashMap<String, i32>,
+}
+
+impl Spreadsheet {
+    fn new(_rows: i32) -> Self {
+        Spreadsheet {
+            d: HashMap::new(),
+        }
+    }
+
+    fn set_cell(&mut self, cell: String, value: i32) {
+        self.d.insert(cell, value);
+    }
+
+    fn reset_cell(&mut self, cell: String) {
+        self.d.remove(&cell);
+    }
+
+    fn get_value(&self, formula: String) -> i32 {
+        let mut ans = 0;
+        for cell in formula[1..].split('+') {
+            if cell.chars().next().unwrap().is_ascii_digit() {
+                ans += cell.parse::<i32>().unwrap();
+            } else {
+                ans += *self.d.get(cell).unwrap_or(&0);
+            }
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3400-3499/3484.Design Spreadsheet/Solution.rs

@@ -0,0 +1,31 @@
+use std::collections::HashMap;
+
+struct Spreadsheet {
+    d: HashMap<String, i32>,
+}
+
+impl Spreadsheet {
+    fn new(_rows: i32) -> Self {
+        Spreadsheet { d: HashMap::new() }
+    }
+
+    fn set_cell(&mut self, cell: String, value: i32) {
+        self.d.insert(cell, value);
+    }
+
+    fn reset_cell(&mut self, cell: String) {
+        self.d.remove(&cell);
+    }
+
+    fn get_value(&self, formula: String) -> i32 {
+        let mut ans = 0;
+        for cell in formula[1..].split('+') {
+            if cell.chars().next().unwrap().is_ascii_digit() {
+                ans += cell.parse::<i32>().unwrap();
+            } else {
+                ans += *self.d.get(cell).unwrap_or(&0);
+            }
+        }
+        ans
+    }
+}