版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/mike_learns_to_rock/article/details/46842789
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 text, int nRows);
convert(“PAYPALISHIRING”, 3) should return “PAHNAPLSIIGYIR”.
题目意思就是在首尾行中间徘徊着写字母。设置一个字符串数组。数组的元素个数就是行数。最后把每一行都拼接起来。
代码如下:
string convert(string s, int numRows) {
if(numRows<=1) return s;//注意只有1行时无法满足下面的for循环的。
string res[numRows];
int step=1;
int row=0;
for(int i=0;i<s.size();i++){
if(row==0) step=1;
if(row==numRows-1) step=-1;
res[row]+=s[i];
row=row+step;
}
for(int i=1;i<numRows;i++){
res[0]+=res[i];
}
return res[0];
}