6. Zigzag Conversion

Complexity Analysis:

• Time Complexity: $O(n)$. $n$ is the length of s. We iterate s for one time, so the time complexity is $O(n)$.
• Space Complexity: $O(n)$. We save the data in rows that maximum space is $O(n)$.