Leetcode 6 ZigZag Conversion
class Solution {
public:
string convert(string s, int numRows) {
if(numRows == 1)
return s;
string res = "";
for(int i = 0;i < numRows; ++i){
res += s[i];
int gap = 2*numRows -2;
for(int j = 1;i+j*gap - 2*i < s.length(); ++j){
if(i != 0 && i !=numRows-1){
res += s[i + j*gap - 2*i];
}
if(i+j*gap <s.length())
res += s[i+j*gap];
}
}
return res;
}
};