原题链接:https://leetcode.com/problems/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 RAnd 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"
.
举个通用的例子:
0 8 16
1 7 9 15 17
2 6 10 14 18
3 5 11 13 19
4 12 20
nRows 即行数为5,即将原字符串分为五行。我们发现每一个V形 包含 2*(nRows-1),此例子中就是0~7 一共8个数
另外在两个满列之间包含的数(5 6 7) 有 nRows-2 个(5-2=3个),即除去第一行和最后一行两个数。
那么我们可以按照 行数 进行循环,而且很容易发现规律,在中间行的时候, j+2*(nRows-i-1)
代码如下:
class Solution {
public:
string convert(string s, int numRows) {
if (numRows == 1) return s;
string res;
int i = 0, j, gap = numRows - 2;
for (int i = 0; i < numRows; ++i){
for (int j = i; j < s.length(); j += 2 * (numRows - 1)){
res.push_back(s[j]);
if (i>0 && i < numRows - 1){
if (j + 2 * (numRows - i - 1) < s.length())
res.push_back(s[j + 2 * (numRows - i - 1)]);
}
}
}
return res;
}
};