<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) {
        //Boundary Case:
        if(numRows == 1 || numRows==s.size()) return s;

        //Normal Case Handling:
        vector<string> rows(numRows);
        int size = s.size(),j=0,inc=1;
        

        for(int i=0; i<size; i++){
            rows[j].push_back(s[i]);
            j += inc;
            if(j==numRows){
                inc = -1;
                j = numRows-2;
            }
            if(j<0){
                inc = 1;
                j = 1;
            }
        }
        // while(i<size){
        //     for(int j=0; j<numRows && i<size ; j++){
        //         rows[j].push_back(s[i++]);
        //     }
            
        //     if(numRows>2 && i<size){
        //         for(int k=(numRows-2); k>=1 && i<size; k--){
        //             rows[k].push_back(s[i++]);
        //         }
        //     }
        // }
        s="";
        for(int i=0; i<numRows; i++ ){
            s.append(rows[i]);
        }
        return s;
    }
};
12593