PS/LeetCode
[Leet Code] 006 ZigZag Conversion
시옷지읏
2021. 5. 10. 03:41
class Solution {
public:
string convert(string s, int numRows) {
if(numRows==1) return s;
int divider = numRows + numRows-2;
vector<string> matrix(numRows);
for(int i=0; i<s.size(); ++i){
int index = i % divider;
if(index < numRows)
{
matrix.at(index%numRows).push_back(s[i]);
}
else
{
index = index % (numRows-1);
matrix.at(numRows-1-index).push_back(s[i]);
}
}
string result;
for(string str:matrix){
result.append(str);
for(char c:str){
cout << c << " ";
}
cout << endl;
}
return result;
}
};