feat: add solutions to lc problem: No.0059

No.0059.Spiral Matrix II

Author: YangFong

solution/0000-0099/0059.Spiral Matrix II/README.md

@@ -130,6 +130,31 @@ function generateMatrix(n: number): number[][] {
 }
 ```
 
+```ts
+function generateMatrix(n: number): number[][] {
+    const res = new Array(n).fill(0).map(() => new Array(n).fill(0));
+    let num = 1;
+    for (let i = 0; i < Math.floor(n / 2); i++) {
+        for (let j = i; j < n - i - 1; j++) {
+            res[i][j] = num++;
+        }
+        for (let j = i; j < n - i - 1; j++) {
+            res[j][n - i - 1] = num++;
+        }
+        for (let j = i; j < n - i - 1; j++) {
+            res[n - i - 1][n - j - 1] = num++;
+        }
+        for (let j = i; j < n - i - 1; j++) {
+            res[n - j - 1][i] = num++;
+        }
+    }
+    if (n % 2 === 1) {
+        res[n >> 1][n >> 1] = num;
+    }
+    return res;
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -163,6 +188,40 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn generate_matrix(n: i32) -> Vec<Vec<i32>> {
+        let n = n as usize;
+        let mut res = vec![vec![0; n]; n];
+        let mut num = 1;
+        for i in 0..n / 2 {
+            for j in i..n - i - 1 {
+                res[i][j] = num;
+                num += 1;
+            }
+            for j in i..n - i - 1 {
+                res[j][n - i - 1] = num;
+                num += 1;
+            }
+            for j in i..n - i - 1 {
+                res[n - i - 1][n - j - 1] = num;
+                num += 1;
+            }
+            for j in i..n - i - 1 {
+                res[n - j - 1][i] = num;
+                num += 1;
+            }
+        }
+        if n % 2 == 1 {
+            res[n >> 1][n >> 1] = num;
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0059.Spiral Matrix II/README_EN.md

@@ -120,6 +120,31 @@ function generateMatrix(n: number): number[][] {
 }
 ```
 
+```ts
+function generateMatrix(n: number): number[][] {
+    const res = new Array(n).fill(0).map(() => new Array(n).fill(0));
+    let num = 1;
+    for (let i = 0; i < Math.floor(n / 2); i++) {
+        for (let j = i; j < n - i - 1; j++) {
+            res[i][j] = num++;
+        }
+        for (let j = i; j < n - i - 1; j++) {
+            res[j][n - i - 1] = num++;
+        }
+        for (let j = i; j < n - i - 1; j++) {
+            res[n - i - 1][n - j - 1] = num++;
+        }
+        for (let j = i; j < n - i - 1; j++) {
+            res[n - j - 1][i] = num++;
+        }
+    }
+    if (n % 2 === 1) {
+        res[n >> 1][n >> 1] = num;
+    }
+    return res;
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -153,6 +178,40 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn generate_matrix(n: i32) -> Vec<Vec<i32>> {
+        let n = n as usize;
+        let mut res = vec![vec![0; n]; n];
+        let mut num = 1;
+        for i in 0..n / 2 {
+            for j in i..n - i - 1 {
+                res[i][j] = num;
+                num += 1;
+            }
+            for j in i..n - i - 1 {
+                res[j][n - i - 1] = num;
+                num += 1;
+            }
+            for j in i..n - i - 1 {
+                res[n - i - 1][n - j - 1] = num;
+                num += 1;
+            }
+            for j in i..n - i - 1 {
+                res[n - j - 1][i] = num;
+                num += 1;
+            }
+        }
+        if n % 2 == 1 {
+            res[n >> 1][n >> 1] = num;
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0059.Spiral Matrix II/Solution.rs

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