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"
.
解决思路:本题目要求将一个字符串先按列排列(第一列nRows个字符,第二列nRows-2个字符,第三列nRows个字符,第四列nRows-2个字符,依次),然后按行读出来。设置了依着变量row来控制行的变化,当row>=0且row<nRows-1时,step都是1,row+=step即row++,当nRows==nRows-1(因为从0开始计数),step=-1,row-=step即row--,减到0,如此循环下去。vector<string> r (nRows),一个包含nRows个字符串的容器,r[row](从零开始计数)记录的是按列排列后出现在第row行的拼接起来的字符串,如题目例子中,r[0]="PAHN",r[1]="APLSIIG",r[2]="YIR".最后将容器中所有的字符串拼接起来即可,即将r[0],r[1],r[2],...,r[nRows-1]拼接起来。
class Solution {
public:
string convert(string s, int nRows) {
if (nRows<=1 || nRows>=s.size()) return s;
vector<string> r(nRows);
int row = 0;
int step = 1;
for(int i=0; i<s.size(); i ++) {
if (row == nRows-1) step = -1;
if (row == 0) step = 1;
//cout << row <<endl;
r[row] += s[i];
row += step;
}
string result;
for (int i=0; i<nRows; i++){
result += r[i];
}
return result;
}
};