leetCode 6:ZigZag Conversion
题目:
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”
分析:
本题是对字符串进行操作,本质上是一道数学题,需要找到字符分布的相应规律,通过对zigzag的了解,以及推算证明,得到每行字符的分布规律,第一行和最后一行字符间隔为2*(numRows-1),而中间行字符间隔的规律则与所在列相关,假如所在列为奇数列,则下一字符间隔为2*(numRows-i-1);若所在列为偶数列,则下一字符间隔为2i.这一规律可以通过画图直观的得到,第一行与最后一行的相邻两个顶点构成一个类似v的形状,而对于中间行,分布在v的中间部分,间隔为v下方顶点数加1或上方顶点数加1.
代码:
public class ZigZag {
public static String convert(String s,int numRows){
if(numRows<=1||s.length()==0)
return s;
int len=s.length();
int step=2*(numRows-1);
String res="";
for(int i=0;i<len && i<numRows;++i){
int indx=i;
res +=s.charAt(indx);
for(int j=1;j<len;++j){
if(i==0 || i==numRows-1){
indx +=step;
}else{
if(j % 2 != 0)
indx +=2*(numRows-1-i);
else
indx +=2*i;
}
if(indx<len)
res +=s.charAt(indx);
}
}
return res;
}
public static void main(String[] args){
String s="PAYPALISHIRING";
String result=convert(s,3);
System.out.println("转换后的字符串为:"+result);
}
}