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 text, int nRows);
convert("PAYPALISHIRING", 3) should return "PAHNAPLSIIGYIR".

问题分析：

1. 先将字符串按照给定的行数n，按照垂直方向的zig-zag模式进行排列

2. 对于排列后的阵列，按照行优先的顺序进行输出

对于第 i 行 中出现的下标有计算公式

subscript[i] = subscript[i - 1] + 2 * det[k]

此处需要补充图片进行形象的说明。

示例代码：

 string convert(string s, int nRows) 
    {
        string res;
        if (nRows <= 0) return res;
        int n = s.length();
        if (nRows == 1 || nRows >= n) return s;
        res = s;
        for (int i = 0, k = 0; i < nRows; i++)
        {
            int cur = i, j = 0;
            int det[2] = {2 * (nRows - 1 - i), 2 * i}; /* 计算正确的det值 */
            if (det[0] == 0) det[0] = det[1];
            if (det[1] == 0) det[1] = det[0];
            while (cur < n) /* 找到第 i 行的全部下标，进行重新拼接 */
            {
                res[k++] = s[cur];
                cur = cur + det[j & 1];
                j++;
            }
        }
        return res;
    }