版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/l718531794/article/details/84455519
题目地址:https://leetcode-cn.com/problems/zigzag-conversion/
题意:字面意思
思路:模拟一下就好了
AC代码:
class Solution {
public:
string convert(string s, int numRows) {
string ans = "";
int length = s.length();
int p = 0;
if(numRows==1)
return s;
for(int i=0;i<numRows;i++){
for(int j = i;j<length;j+=2*(numRows-1)){
ans+=s[j];
//cout<<s[j]<<" ";
if(i!=0 && i!=numRows-1 && j+2*(numRows-i-1)<length ){
ans+=s[j+2*(numRows-i-1)];
//cout<< s[j+2*(numRows-i-1)]<<" ";
}
}
// cout<<endl;
}
return ans;
}
};