LeetCode 学习记录 6. ZigZag Conversion

1 题目要求：

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

2 解决方法:

将Z型可以先转换成W型进行问题简化，然后每行根据排列规律输出

static const void* ___ = []() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    return nullptr;
}();
class Solution {
public:
	string convert(string s, int numRows) {
		if (numRows == 1) return s;
		const int len = s.length();
		string *str = new string[1];

		for (int row = 0; row < numRows; row++) {
			for (int i = 0; i + row < len; i+=(2 * numRows - 2)) {
				(*str).push_back(s[i + row]);
				if (((i + 2 * numRows - 2 - row) < len) && (row != 0) && (row != numRows - 1))
					(*str).push_back(s[i + 2 * numRows - 2 - row]);
			}
		}
		s.clear();
		s.append(*str);
		delete[]str;
		return s;
	}
};

性能还不错

时间复杂度O(n)

空间复杂度O(n)

另外参考他们答案，也可以多行单独存储，最后连接。

string convert(string s, int nRows) {
    
    if (nRows <= 1)
        return s;

    const int len = (int)s.length();
    string *str = new string[nRows];

    int row = 0, step = 1;
    for (int i = 0; i < len; ++i)
    {
        str[row].push_back(s[i]);

        if (row == 0)
            step = 1;
        else if (row == nRows - 1)
            step = -1;

        row += step;
    }

    s.clear();
    for (int j = 0; j < nRows; ++j)
    {
        s.append(str[j]);
    }

    delete[] str;
    return s;
}

算法复杂度相同，这个更容易理解不需要数学推导。