<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 {
public:
    string convert(string s, int numRows) {
        vector<vector<char>> result;
        int count = 0;
        int i = 0;
        for(; i < s.size(); ) {
            vector<char> cols(numRows,' ');
            
            if(count == 0 || count == numRows-1) {
                for(int j = numRows-1; j >= 0 && i < s.size(); j--) {
                    cols[j] = s[i++];
                }
                count = 1;
            } else {
                if(i < s.size()){  
                    cols[count] = s[i++];
                }
                count += 1;
            }
            result.push_back(cols);
           
            count = count%numRows;
        }
        if(result.size() == 0) {
            return "";
        } else {
            string resultStr = "";
            for(int j = result[0].size()-1; j >= 0; j--) {
                for(int i = 0; i < result.size(); i++) {
                    if(result[i][j] != ' ') {
                        resultStr.push_back(result[i][j]);
                    }
                }
            }
            return resultStr;
        }
    }
};
32393