题目
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
分析
这个题目十分有意思。它把字符换进行N字形排列然后一行一行输出。作为一个normal题肯定不可能是构造二维数组然后进行遍历。实际上仔细分析一下转换后的结果就会发现:主列(例如Example2 里面PAYP那一列与ISHI那一列和NG那一列)之间的下标差值都是固定的,即(2*numRows)-2。然后除了第一行和最后一行之外,其他行的构造都是主列、非主列(即N字形斜着的那部分)、主列、非主列、主列、非主列……然后非主列元素的下标都可以根据主列元素的下标找到。比如第2行,主列元素下标-2就是非主列元素下标,然后第3行主列元素下标-4就是非主列元素……
参考博客https://www.cnblogs.com/grandyang/p/4128268.html
代码
class Solution {
public:
string convert(string s, int nRows) {
if (nRows <= 1) return s;
string res = "";
int size = 2 * nRows - 2;
for (int i = 0; i < nRows; ++i) {
for (int j = i; j < s.size(); j += size) {
res += s[j];
int tmp = j + size - 2 * i;
if (i != 0 && i != nRows - 1 && tmp < s.size()) res += s[tmp];
}
}
return res;
}
};