题目
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在英语里的意思是锯齿,也就是说需要把给定的字符串s以给定的行数nRows按照锯齿状排列,最后返回的字符串是该排列下按照从上至下,从左至右的字符顺序。最容易想到的就是利用一个字符串数组rowsOfStr来存储锯齿排列下每一行的字符串,最后将这个数组的每一个字符串拼接起来就是返回的结果。
首先遍历字符串s中的每一个字符,每个字符都有对应的行数row,当前字符的行数row加上moveDistance即为下一个字符出现的行数,一般情况下moveDistance为1,只有当字符处于第1行和第nRows行时需要作调整。
代码
public class Solution {
public String convert(String s, int nRows) {
String ret = "";
String[] rowsOfStr = new String[nRows];
Arrays.fill(rowsOfStr,"");
int len = s.length();
if (len == 0 || nRows <= 1 || nRows >= len)
return s;
int row = 0, moveDistance = 1;
for (int i = 0; i < len; i++) {
rowsOfStr[row] += s.charAt(i);
row += moveDistance;
if (row >= nRows) {
row = nRows - 2;
moveDistance = -1;
}
if (row < 0) {
row = 1;
moveDistance = 1;
}
}
for (int i = 0; i < nRows; i++) {
ret += rowsOfStr[i];
}
return ret;
}
}