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"
.
此处借用桑海的图来说明Zigzag的模式
Zigzag:即循环对角线结构
0 | | | | 8 | | | | 16 | | | |
1 | | | 7 | 9 | | | 15 | 17 | | | |
2 | | 6 | | 10 | | 14 | | 18 | | | |
3 | 5 | | | 11 | 13 | | | 19 | | | |
4 | | | | 12 | | | | 20 | | |
由此可以一目了然,我们对字符串位号取余 mod= 2(nRows- 1)
对于i位,i%mod有两种可能:
1,小于nRows, 那么就在i%mod行
2,大于等于nRows,那么就在mod- i%mod行
之后按照正常思维的逻辑遍历字符串,之后push到字符串向量中,形成上图的样子,再输出即可
class Solution {
public:
string convert(string s, int nRows) {
int len;
len= s.length();
if(nRows== 1|| len<= 1) return s;
string ans;
vector<string>m(nRows);
int mod= 2*(nRows- 1);
for(int i= 0; i< len; i++){
int temp= i% mod;
if(temp< nRows){
m[temp].push_back(s[i]);
}
else{
m[mod- temp].push_back(s[i]);
}
}
for(int i= 0; i< nRows; i++){
ans+= m[i];
}
return ans;
}
};