<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:
    const vector<vector<int>>moves = { {0,1},{1,-1} };
string convert(string s, int numRows) {
    if (numRows == 1) return s;
    if (numRows == 2) {
        string result = "";
        for (int i = 0; i < s.size(); i += 2) result += s[i];
        for (int i = 1; i < s.size(); i += 2) result += s[i];
        return result;
    }
    vector<vector<char>> map((numRows-1)*ceil(double(s.size()) / (2 * numRows - 2)), vector<char>(numRows, NULL));
    int count = 0;
    int x = 0;
    int y = 0;
    map[x][y] = s[count];
    count++;
    while (count < s.size()) {
        for (int i = 0; i < numRows-1; i++) {
            if (count == s.size()) break;
            x += moves[0][0];
            y += moves[0][1];
            map[x][y] = s[count];
            count++;
        }
        for (int i = 0; i < numRows-1; i++) {
            if (count == s.size()) break;
            x += moves[1][0];
            y += moves[1][1];
            map[x][y] = s[count];
            count++;
        }
    }
    string result = "";
    for (int i = 0; i < numRows; i++) {
        for (int j = 0; j < map.size(); j++) {
            if (map[j][i] == NULL) continue;
            result += map[j][i];
        }
    }
    return result;
}
};
38168