add 6

Author: luliyucoordinate

README.md

@@ -9,7 +9,7 @@ LeetCode
 |0003|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/total-hamming-distance/) | c | [c++](./src/0003-Longest-Substring-Without-Repeating-Characters/0003.cpp) |[python](./src/0003-Longest-Substring-Without-Repeating-Characters/0003.py)|||Medium|
 |0004|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | c | [c++](./src/0004-Median-of-Two-Sorted-Arrays/0004.cpp) |[python](./src/0004-Median-of-Two-Sorted-Arrays/0004.py)|||Hard|
 |0005|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | c | [c++](./src/0005-Longest-Palindromic-Substring/0005.cpp) |[python](./src/0005-Longest-Palindromic-Substring/0005.py)|||Medium|
-|0006|[ZigZag Conversion](https://leetcode.com/problems/third-maximum-number/) | c | [c++]() |python|||Medium|
+|0006|[ZigZag Conversion](https://leetcode.com/problems/third-maximum-number/) | c | [c++](./src/0006-ZigZag-Conversion/0006.cpp) |[python](./src/0006-ZigZag-Conversion/0006.py)|||Medium|
 |0007|[Reverse Integer](https://leetcode.com/problems/arithmetic-slices/) | c | [c++]() |python|||Easy|
 |0008|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | c | [c++](./src/0010-Regular-Expression-Matching/0010.cpp) |[python](./src/0010-Regular-Expression-Matching/0010.py)|||Medium|
 |0009|[Palindrome Number](https://leetcode.com/problems/split-array-largest-sum/) | c | [c++]() |python|||Easy|

src/0006-ZigZag-Conversion/0006.cpp

@@ -0,0 +1,25 @@
+#include <string>
+#include <vector>
+using namespace std;
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+
+class Solution 
+{
+public:
+    string convert(string s, int numRows) 
+    {
+        if (numRows == 1 or s.size() < numRows) return s;
+        vector<string> L(numRows, "");
+        int index = 0, step = 1;
+        for (auto ch : s)
+        {
+            L[index] += ch;
+            if (index == 0) step = 1;
+            else if (index == numRows - 1) step = -1;
+            index += step;
+        }
+        string res;
+        for (auto& s : L) res += s;
+        return res;
+    }
+};

src/0006-ZigZag-Conversion/0006.py

@@ -0,0 +1,23 @@
+class Solution:
+    def convert(self, s, numRows):
+        """
+        :type s: str
+        :type numRows: int
+        :rtype: str
+        """
+
+        if numRows == 1 and len(s) < numRows:
+            return s
+
+        L = [''] * numRows
+        index, step = 0, 1
+
+        for x in s:
+            L[index] += x
+            if index == 0:
+                step = 1
+            elif index == numRows -1:
+                step = -1
+            index += step
+
+        return ''.join(L)