题目
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"
.
class Solution {
public:
string convert(string s, int numRows) {
}
};
思路
将字符串表示如下: r
P A H N (0)
A P L S I I G (1)
Y I R (2)
当r不是第一行和最后一行,第一个字母到下一个的距离是
(numRows-r-
1
)*2,第二字母到第三个的距离是2r,第三个到第四个又是(numRows-r-1)*2,依次循环。第一行和对后一行则分别将原字符串的下标加(numRows-r-1)*2和2r。用这种方法按下标依次找出原字符串的字母加到新字符串上。
所以有下面的代码,算法复杂度为O(n)。
代码
class Solution {
public:
string convert(string s, int numRows) {
string result = "";
if (s.empty()) {
return "";
}
if (numRows == 1) {
return s;
}
int size = s.length();
for (int r = 0; r < numRows; r++) {
int i = r;
int a = (numRows-r-1)*2, b = 2*r;
if (a == 0) {//最后一行
while (i < size) {
result += s[i];
i += b;
}
continue;
}
if (b == 0) {//第一行
while (i < size) {
result += s[i];
i += a;
}
continue;
}
while (i < size) {
result += s[i];
i += a;
if (i < size) {
result += s[i];
i += b;
}
}
}
return result;
}
};