题目描述
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 RAnd 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"
.
以Z字形排列已知的字符串,然后逐行输出新的字符串。
解题思路
根据示例我们很容易看到最终结果,通过分析,有以下几种情况:
在实际代码中,我们可以设置一个变量boolean isForward 来指示方向,当正向时,扫描nRows个字母,逆向时扫描nRows-2个字母,直到扫描完字符串为止。
代码
public static String convert(String s, int nRows) {
//nRows = 1 的情况
if (nRows == 1)
return s;
String result = "";
String[] strRows = new String[nRows];
boolean isForward = true;
//需将每行的字符穿初始化为""
for (int i = 0; i < nRows; i++) {
strRows[i] = "";
}
for (int i = 0; i < s.length();) {
if (isForward) {
//正向扫描时,行号初始为0,循环递增至nRows - 1
for (int j = 0; j < nRows && i < s.length(); j++, i++) {
strRows[j] += s.charAt(i);
isForward = false;
}
} else {
if (nRows == 2) {
//当nRows = 2时,一直以正向扫描
isForward = true;
} else {
//逆向扫描时,行号初始为nRows-2,循环递减至1,相当于去掉斜线两头的字母
for (int j = nRows - 2; j > 0 && i < s.length(); j--, i++) {
strRows[j] += s.charAt(i);
isForward = true;
}
}
}
}
for (int i = 0; i < nRows; i++) {
result += strRows[i];
}
return result;
}