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".

题意就是把输入字符串写成 Z 之型，然后按行读出。当有4行时

P          I            N

A      L  S       I  G

Y  A     H   R

P          I

简单的模拟，new一个二维数组，将字符串存进去然后按行读取就好，数组初始化为全空格，后面按行读的时候容易判断。

string convert(string s, int numRows){
    if(numRows == 1)
        return s;
    long len = s.size();
    long n = (len/(2*numRows-2) +1)*numRows;
    char **array;
    array = new char*[numRows];
    for(int i = 0; i < numRows; i++){
        array[i] = new char[n];
    }
    for(int i = 0; i < numRows; i++)
        for(int j = 0; j < n; j++)
            array[i][j] = ' ';
    int cur = 0, i = 0, j = 0;
    while(cur < s.size()){
        for(; i < numRows && cur < s.size(); i++, cur++)
            array[i][j] = s[cur];
        i -= 2;
        j++;
        for(; i >= 0 && cur < s.size(); i--, j++, cur++)
            array[i][j] = s[cur];
        i += 2;
    }

    string s1;
    for(i = 0; i < numRows; i++)
        for(j = 0; j < n; j++)
            if(array[i][j] != ' ')
                s1 += array[i][j];
    return s1;
}

可以把数据这样存储以减少数组的列数

P       I        N

A   L  S   I  G

Y  A  H   R

P       I

在第二个for循环中把j++去掉就行，数组列数可以减少到 len/(2*numRows-2)+1

此题还可以直接计算出每行字符在原字符串中的位置直接写出来

    string convert(string s, int numRows) {
        if(numRows == 1)
            return s;
        string s1("");
        int size = s.size();
        int n = 2*numRows -2, m = size/n;
        if(size%n != 0)
            m++;
        for(int i = 0; i < numRows; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || i == numRows-1){
                    if(i+j*n < size)
                        s1 += s[i+j*n];
                }
                else{
                    if(i+j*n < size)
                        s1 += s[i+j*n];
                    if(i+j*n+(numRows-i-1)*2 < size)
                        s1 += s[i+j*n+(numRows-i-1)*2];
                }
            }
        }
        return s1;
    }