[Leetcode] 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 s, int numRows);

Example 1:

Input: s = "PAYPALISHIRING", numRows = 3
Output: "PAHNAPLSIIGYIR"

Example 2:

Input: s = "PAYPALISHIRING", numRows = 4
Output: "PINALSIGYAHRPI"
Explanation:

P     I    N
A   L S  I G
Y A   H R
P     I

解题：

1. 每个Z子形的第一row的顶点序号为2*numRows-2的整数倍，给定初始row，col，判断下一个字符的row和col。注意用到了string指针。

class Solution {
public:
    string convert(string s, int numRows) {
        
        string* zz = new string[numRows];
        int i,j;
        int row = 1, col = -1;
        int n = numRows; 
        
        if(s.size()<2) return s;
        if(numRows==1) return s;
        
        for(i=0;i<s.size();i++)
        {
            if(i%(2*n-2)<n && i%(2*n-2)>0)
            {
                row = row+1;
                col = col;                
            }
            else if(i%(2*n-2)==0 || i%(2*n-2)>=n)
            {
                row = row-1;
                col = col +1;
            }
            
            zz[row].push_back(s[i]);
        }
        
        // cout<<zz[0]<<endl;
        
        s.clear();
        
        for(j=0;j<n;j++)
        {
            s.append(zz[j]);
        }
        
        return s;
        
    }
};

2. 直接定位每个位置的序号：

For all whole numbers $k$,

• Characters in row $0$ are located at indexes $k(2\cdot \text{numRows}-2)$
• Characters in row $\text{numRows}-1$ are located at indexes $k(2\cdot \text{numRows}-2)+\text{numRows}-1$
• Characters in inner row $i$ are located at indexes $k(2\cdot \text{numRows}-2)+i$ and $(k+1)(2\cdot \text{numRows}-2)-i$.

class Solution {
public:
    string convert(string s, int numRows) {

        if (numRows == 1) return s;

        string ret;
        int n = s.size();
        int cycleLen = 2 * numRows - 2;

        for (int i = 0; i < numRows; i++) {
            for (int j = 0; j + i < n; j += cycleLen) {
                ret += s[j + i];
                if (i != 0 && i != numRows - 1 && j + cycleLen - i < n)
                    ret += s[j + cycleLen - i];
            }
        }
        return ret;
    }
};