fix: show solutions

No.0006.ZigZag Conversion

Author: YangFong

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

@@ -71,15 +71,199 @@ P     I
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def convert(self, s, numRows):
+        """
+        :type s: str
+        :type numRows: int
+        :rtype: str
+        """
+
+        if numRows == 0:
+            return ""
+        elif numRows == 1:
+            return s
+
+        Ret = [[] for i in range(numRows)]
+        i = 0
+        while i < len(s):
+            j = 0
+            while i < len(s) and j < numRows:  # Vertical lines
+                Ret[j].append(s[i])
+                i += 1
+                j += 1
+            j -= 2
+            while i < len(s) and j > 0:  # Diagonal lines
+                Ret[j].append(s[i])
+                j -= 1
+                i += 1
+
+        return "".join(["".join(row) for row in Ret])
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public String convert(String s, int numRows) {
+        if (numRows == 1) return s;
+        StringBuilder result = new StringBuilder();
+        int group = 2 * numRows - 2;
+        for (int i = 1; i <= numRows; i++) {
+            int interval = 2 * numRows - 2 * i;
+            if (i == numRows) interval = 2 * numRows - 2;
+            int index = i;
+            while (index <= s.length()) {
+                result.append(s.charAt(index - 1));
+                index += interval;
+                interval = group - interval;
+                if (interval == 0) interval = group;
+            }
+        }
+        return result.toString();
+    }
+}
+```
+
+### **C++**
+
+```cpp
+// @ID:6. ZigZag Conversion
+// @author:jxdeng3989
+
+class Solution {
+public:
+    string convert(string s, int numRows) {
+        string retstr;
+        if(1==numRows)
+            return s;
+        for(int i=0; i<numRows; ++i)
+        {
+            retstr.push_back(s[i]);
+            int maxspan = 2*(numRows-1);
+            int span1 = maxspan-i*2;
+            int span2 = maxspan - span1;
+             int cntpos = i;
+            if(span1==0)
+                span1 = span2;
+            if(span2==0)
+                span2 = span1;
+             while(1)
+             {   
+				 if(cntpos+span1>=s.size())
+					 break;
+                 cntpos += span1;
+                 retstr.push_back(s[cntpos]);
+                 
+                 if(cntpos+span2>=s.size())
+                     break;
+                 cntpos += span2;
+                 retstr.push_back(s[cntpos]);
+             }
+        }
+        return retstr;
+    }
+};
+```
+
+### **C#**
+
+```cs
+using System.Collections.Generic;
+using System.Linq;
+
+public class Solution {
+    public string Convert(string s, int numRows) {
+        if (numRows == 1) return s;
+        if (numRows > s.Length) numRows = s.Length;
+        var rows = new List<char>[numRows];
+        var i = 0;
+        var j = 0;
+        var down = true;
+        while (i < s.Length)
+        {
+            if (rows[j] == null)
+            {
+                rows[j] = new List<char>();
+            }
+            rows[j].Add(s[i]);
+            j = j + (down ? 1 : -1);
+            if (j == numRows || j < 0)
+            {
+                down = !down;
+                j = j + (down ? 2 : -2);
+            }
+            ++i;
+        }
+        return new string(rows.SelectMany(row => row).ToArray());
+    }
+}
+```
+
+### **Go**
+
+```go
+func convert(s string, numRows int) string {
+	if numRows == 1 {
+		return s
+	}
+	length := len(s)
+	result := make([]byte, length)
+	step := 2 * numRows - 2
+	count := 0
+	for i := 0; i < numRows; i++ {
+		for j := 0; j + i < length; j += step {
+			result[count] = s[i+j]
+			count++
+			if i != 0 && i != numRows - 1 && j + step - i < length {
+				result[count] = s[j+step-i]
+				count++
+			}
+		}
+	}
+	return string(result)
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {string} s
+ * @param {number} numRows
+ * @return {string}
+ */
+var convert = function (s, numRows) {
+    if (numRows == 1) return s;
+    let arr = new Array(numRows);
+    for (let i = 0; i < numRows; i++) arr[i] = [];
+    let index = 0,
+        len = s.length,
+        mi = 0,
+        isDown = true;
+    while (index < len) {
+        arr[mi].push(s[index]);
+        index++;
+
+        if (mi >= numRows - 1) isDown = false;
+        else if (mi <= 0) isDown = true;
+
+        if (isDown) mi++;
+        else mi--;
+    }
+    let ans = [];
+    for (let item of arr) {
+        ans = ans.concat(item);
+    }
+    return ans.join('');
+};
+
+const s = 'AB',
+    numRows = 1;
+
+console.log(convert(s, numRows));
 ```
 
 ### **...**