把之字形的字符横向输出

1 2n-1

2 ... 2n

3 n+2 2n+1

... n+1 ...

n 3n-2

以上为n排之字型字符的结构

string convert(string s,
int
numRows)

{string result="";
 

if(numRows==1)return
s;

int
a,b;
 

for(int
i=0;i<numRows;i++)

{a=(numRows-i-1)*2;
 

b=(i)*2;
 

int
position=i;
 

if(position<len)
 

result+=s.at(position);
 

while(1)

{position+=a;
 

if(position>=s.size())
 

break;

if(a)

result+=s.at(position);
 

position+=b;
 

if(position>=s.size())
 

break;

if(b)

result+=s.at(position);
 

}  

}  

return
result;
 

}