6. ZigZag Conversion

The string "PAYPALISHIRING" 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   A   H   N
A P L S I I G
Y   I   R

And then read line by line:  "PAHNAPLSIIGYIR"

Write the code that will take a string and make this conversion given a number of rows:

string convert(string text, int nRows);

convert("PAYPALISHIRING", 3)  should return  "PAHNAPLSIIGYIR" .

此题有两种思路；

思路一：可以初始化rows个字符串数组ch0[], ch1[]...chn[], 在cho[]内存储第一行的所有字符信息，同理在chn[]内存储第n行的字符信息，最后依次拼接ch0[]~chn[]即可。

思路二：初始化一个大小为text字符串长度的数组，数组按顺序分别插入第一行字符、第二行字符等。

本题大的思路较简单，程序处理时需特别注意边界条件，如rows为1和2的情形，rows >= 3时都很好处理。

class Solution {
    public String convert(String s, int numRows) {
         if (numRows <= 1){
             return s;
         }
         int len = s.length();
         char[] ch = new char[len];
         int m = 0, val = 0, index = 0;
         int t = 2*(numRows - 1);
         for (int i = 0; i < numRows; ++ i){
             for (int j = i; j < len; j = j + t){
                 ch[index++] = s.charAt(j);
                 int sec = (j - i) + t - i;
                 // filter zigzag up and down boundary, lenth limit aim to when numRows larger than string length
                 if (i != 0&&i != numRows - 1&&sec < s.length()){
                     ch[index++] = s.charAt(sec);
                 }
             }
         }
         return new String(ch);
     }
}