The description of the question can be found in the following link:
https://leetcode.com/problems/zigzag-conversion/submissions/
- My Code;

Explain: The idea is quite clear. For each character in the string, find out which line does is belong to. As we go through the string from left to right and it is exactly the order required in the zigzag conversion, hence we do not need to worry too much about the order of the conversion. We use a dictionary to store the character in each row, and then we put all of them together at the same time in the end. One special case is when the required row number is one, in this case we just need to return the original string.