feat: add solutions to lc problem: No.0006

No,0006.ZigZag Conversion

Author: YangFong

solution/0000-0099/0006.ZigZag Conversion/README.md

@@ -266,6 +266,63 @@ const s = 'AB',
 console.log(convert(s, numRows));
 ```
 
+### **TypeScript**
+
+```ts
+function convert(s: string, numRows: number): string {
+    if (numRows === 1) {
+        return s;
+    }
+    const ss = new Array(numRows).fill('');
+    let i = 0;
+    let toDown = true;
+    for (const c of s) {
+        ss[i] += c;
+        if (toDown) {
+            i++;
+        } else {
+            i--;
+        }
+        if (i === 0 || i === numRows - 1) {
+            toDown = !toDown;
+        }
+    }
+    return ss.reduce((r, s) => r + s);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn convert(s: String, num_rows: i32) -> String {
+        let num_rows = num_rows as usize;
+        if num_rows == 1 {
+            return s;
+        }
+        let mut ss = vec![String::new(); num_rows];
+        let mut i = 0;
+        let mut to_down = true;
+        for c in s.chars() {
+            ss[i].push(c);
+            if to_down {
+                i += 1;
+            } else {
+                i -= 1;
+            }
+            if i == 0 || i == num_rows - 1 {
+                to_down = !to_down;
+            }
+        }
+        let mut res = String::new();
+        for i in 0..num_rows {
+            res += &ss[i];
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0006.ZigZag Conversion/README_EN.md

@@ -260,6 +260,63 @@ const s = 'AB',
 console.log(convert(s, numRows));
 ```
 
+### **TypeScript**
+
+```ts
+function convert(s: string, numRows: number): string {
+    if (numRows === 1) {
+        return s;
+    }
+    const ss = new Array(numRows).fill('');
+    let i = 0;
+    let toDown = true;
+    for (const c of s) {
+        ss[i] += c;
+        if (toDown) {
+            i++;
+        } else {
+            i--;
+        }
+        if (i === 0 || i === numRows - 1) {
+            toDown = !toDown;
+        }
+    }
+    return ss.reduce((r, s) => r + s);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn convert(s: String, num_rows: i32) -> String {
+        let num_rows = num_rows as usize;
+        if num_rows == 1 {
+            return s;
+        }
+        let mut ss = vec![String::new(); num_rows];
+        let mut i = 0;
+        let mut to_down = true;
+        for c in s.chars() {
+            ss[i].push(c);
+            if to_down {
+                i += 1;
+            } else {
+                i -= 1;
+            }
+            if i == 0 || i == num_rows - 1 {
+                to_down = !to_down;
+            }
+        }
+        let mut res = String::new();
+        for i in 0..num_rows {
+            res += &ss[i];
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0006.ZigZag Conversion/Solution.rs

@@ -0,0 +1,27 @@
+impl Solution {
+    pub fn convert(s: String, num_rows: i32) -> String {
+        let num_rows = num_rows as usize;
+        if num_rows == 1 {
+            return s;
+        }
+        let mut ss = vec![String::new(); num_rows];
+        let mut i = 0;
+        let mut to_down = true;
+        for c in s.chars() {
+            ss[i].push(c);
+            if to_down {
+                i += 1;
+            } else {
+                i -= 1;
+            }
+            if i == 0 || i == num_rows - 1 {
+                to_down = !to_down;
+            }
+        }
+        let mut res = String::new();
+        for i in 0..num_rows {
+            res += &ss[i];
+        }
+        res
+    }
+}

solution/0000-0099/0006.ZigZag Conversion/Solution.ts

@@ -0,0 +1,20 @@
+function convert(s: string, numRows: number): string {
+    if (numRows === 1) {
+        return s;
+    }
+    const ss = new Array(numRows).fill('');
+    let i = 0;
+    let toDown = true;
+    for (const c of s) {
+        ss[i] += c;
+        if (toDown) {
+            i++;
+        } else {
+            i--;
+        }
+        if (i === 0 || i === numRows - 1) {
+            toDown = !toDown;
+        }
+    }
+    return ss.reduce((r, s) => r + s);
+}