<p>The string <code>&quot;PAYPALISHIRING&quot;</code> is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)</p>

<pre>
P   A   H   N
A P L S I I G
Y   I   R
</pre>

<p>And then read line by line: <code>&quot;PAHNAPLSIIGYIR&quot;</code></p>

<p>Write the code that will take a string and make this conversion given a number of rows:</p>

<pre>
string convert(string s, int numRows);
</pre>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;PAYPALISHIRING&quot;, numRows = 3
<strong>Output:</strong> &quot;PAHNAPLSIIGYIR&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;PAYPALISHIRING&quot;, numRows = 4
<strong>Output:</strong> &quot;PINALSIGYAHRPI&quot;
<strong>Explanation:</strong>
P     I    N
A   L S  I G
Y A   H R
P     I
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;A&quot;, numRows = 1
<strong>Output:</strong> &quot;A&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consists of English letters (lower-case and upper-case), <code>&#39;,&#39;</code> and <code>&#39;.&#39;</code>.</li>
	<li><code>1 &lt;= numRows &lt;= 1000</code></li>
</ul>

class Solution:
    def convert(self, s: str, numRows: int) -> str:
        len_s = len(s)
        list_two = []
        ret_str = ""
        for i in range(0, numRows):
            list1 = []
            for j in range(0, 800):
                list1.append("")
            list_two.append(list1)
        i=0
        tmp_row = 0
        n=0
        if numRows == 1:
            return s
        while i < len(s):
            #print("tmp_row",tmp_row, (numRows-1)*n, s[i])
            list_two[tmp_row][(numRows-1)*n] = s[i]
            tmp_row = tmp_row + 1
            i = i + 1
            if tmp_row == numRows:
                tmp_row = tmp_row-1
                tmp_index = 1
                while (tmp_row>1) and (i< len(s)):
                    tmp_row = tmp_row - 1
                    print(tmp_row, (numRows-1)*n+ tmp_index, s[i])
                    list_two[tmp_row][(numRows-1)*n+tmp_index] = s[i]
                    i = i + 1
                    tmp_index = tmp_index + 1
                tmp_index = 0
                tmp_row = 0
                n=n+1
        print(list_two[0][0])
        for i in range(0,len(list_two)):
            for j in range(0, len(list_two[0])):
                if list_two[i][j]!="":
                    ret_str += list_two[i][j]
        return ret_str
22900