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"
.
题目要求给出一个字符串,将其按照上图所示的“之”字形进行排列,并且按行顺序重新组合字符串。题目不难,只要找到字符间的规律很容易就能完成。将每行看成一个子字符串,然后根据规律将字符填进每个子字符串,最后将所有子字符串进行拼接即可。
仔细观察就可发现,第一行的所有字符(除了首字符)下标在源字符串中都为 2 * numRows - 2 的倍数,我们设这个数为 l ,然后遍历整个字符串,将下标对 l 取模,设取模结果为m,若 m < numRows,则该字符就属于第m行,若m > numRows,则该字符属于 l - m 行。如此遍历完整个字符串,我们就可以得到每一行的字符,将这些字符串拼接即可得到结果。
class Solution {
public:
string convert(string s, int numRows) {
if (numRows == 1) {
return s;
}
string *str = new string[numRows];
int l = 2 * numRows - 2;
for (int i = 0; i < s.length(); i++) {
int m = i % l;
if (m < numRows) {
str[m] += s[i];
} else {
str[l - m] += s[i];
}
}
s.clear();
for (int i = 0; i < numRows; i++) {
s += str[i];
}
delete [] str;
return s;
}
};