string convert(string s, int nRows) {
if(nRows == 1)
return s;
string lines[nRows];
bool dir = 1; // down
int r = 0;
for(int i = 0; i < s.length(); i++){
lines[r] += s[i];
if(r == 0)
dir = 1;
if(r == nRows -1)
dir = 0;
if(dir)
r++;
else
r--;
}
for(int i = 1; i < nRows; i++){
lines[0] += lines[i];
}
return lines[0];
}
Leetcode ZigZag Conversion
最新推荐文章于 2021-11-05 22:58:08 发布