算法设计与分析（6）-- ZigZag Conversion（难度：Medium）

算法设计与分析（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”.

算法思路：

这里题目思路比较简单：string cvt 为转化后的字符串。这里我们可以从cvt[i], i 从0到字符串的长度按顺序求出cvt。求解的方法可以直接通过判断转化后字符串的字符在第几行进行处理。

1.首先判断numRows是否等于1，等于1可以直接返回原字符串：

if (numRows == 1)   return cvt;

2.若numRows不等于1，先求出转化后在第一行的字符：

for (int i = 0; i < len; i = i + 2 * (numRows - 1),++j)
            cvt[j] = s[i];      

3.然后求出第二行至倒数第二行：

        for (int row = 1; row < numRows - 1; ++row)
        {
            bool odd = true;
            for (int i = row; i < len;  ++j)
            {
                cvt[j] = s[i];
                if (odd) {
                    i += 2 * (numRows - 1 - row);
                    odd = false;
                }
                else {
                    i += 2 * row;
                    odd = true;
                }
            }
        }

4.最后求出最后一行：

for (int i = numRows - 1; i < len; i = i + 2 * (numRows - 1), ++j)
            cvt[j] = s[i];

实现代码：

#include<iostream>
#include<string>
using namespace std;

string convert(string s, int numRows) 
{
    const int len = s.length();
    string cvt = s;
    int j = 0;
    if (numRows == 1)   return cvt;
    else 
    {
        for (int i = 0; i < len; i = i + 2 * (numRows - 1),++j)  //the first row
            cvt[j] = s[i];      

        for (int row = 1; row < numRows - 1; ++row)
        {
            bool odd = true;
            for (int i = row; i < len;  ++j)
            {
                cvt[j] = s[i];
                if (odd) {
                    i += 2 * (numRows - 1 - row);
                    odd = false;
                }
                else {
                    i += 2 * row;
                    odd = true;
                }
            }
        }

        for (int i = numRows - 1; i < len; i = i + 2 * (numRows - 1), ++j) //the last row
            cvt[j] = s[i];

        return cvt;
    }
}
int main()
{
    string s = convert("PAYPALISHIRING", 4);
    cout << s << endl;
    return 0;
}