题目:
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
P A H N
A P L S I I G
Y I R
And then read line by line: "PAHNAPLSIIGYIR"
Write the code that will take a string and make this conversion given a number of rows:
string convert(string text, int nRows);
convert("PAYPALISHIRING", 3) should return "PAHNAPLSIIGYIR".
分析:
首先当只有1行的话,直接输出字符串就行了,当行数大于1时,当行数=2时,很简单字符串先输出索引下标为偶数的再输出下标为奇数的,我们可以用行数为4来分析,首先看图:
图中标注的数字表示字符串每个字符对应的索引下标,最后一行一行的字符连接成新的字符串。看图得知第一行和最后一行都是相隔(numRows-1)*2的距离,再看第二行,第三行,(1,5),(7,11),(13,17),(2,4),(8,10),(14,16)他们之间的距离相隔(numRows-row-1)*2(注:row指当前所在行数,从0开始),(5,7),(11,13),(17,19),(4,8),(10,14),(16,20)之间相隔的距离row*2,从而以此类推
代码:
class Solution:
# @param {string} s
# @param {integer} numRows
# @return {string}
def convert(self, s, numRows):
length = len(s);
row = 0;
newString='';
if numRows == 1:
return s
else:
while row<numRows:
i = row;
flagCount = 0;
while i<length:
newString +=s[i];
if row==0 or row==numRows-1:
i+=(numRows-1)*2;
elif flagCount%2==0:
i+=(numRows-row-1)*2
else:
i+=row*2;
flagCount+=1;
row+=1;
return newString