1. 题目描述:
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 s, int numRows);
Example 1:
Input: s = “PAYPALISHIRING”, numRows = 3
Output: “PAHNAPLSIIGYIR”
Example 2:
Input: s = “PAYPALISHIRING”, numRows = 4
Output: “PINALSIGYAHRPI”
Explanation:
P I N
A L S I G
Y A H R
P I
2. 思路分析:
ZigZag 是锯齿形的意思,题目是说将一个字符串按照锯齿形排列,然后按行输出结果。
(1)思路一:
按照锯齿形遍历输入的字符串,然后将每个字符存储到对应的行的字符串中,最后将所有航拼接成最终结果输出。
(2)思路二:
锯齿形排列的规律:发现所有行的重复周期都是 2 * numRows - 2
对于首行和末行之间的行,还会额外重复一次,重复的这一次距离本周期起始字符的距离是 2 * numRows - 2 - 2 * i,找到了这个规律就好办了。
3. Java代码:
源代码
:见我GiHub主页
代码1:时间复杂度O(n)
public String convert(String s, int numRows) {
if (s.length() == 1 || numRows < 2) {
return s;
}
// 用来存储每行的结果
List<StringBuilder> rows = new ArrayList<>();
for (int i = 0; i < Math.min(numRows, s.length()); i++) {
rows.add(new StringBuilder());
}
// 当前所在的行
int curRow = 0;
// 是否是向下行走
boolean goingDown = true;
for (char c : s.toCharArray()) {
rows.get(curRow).append(c);
if (goingDown) {
curRow += 1;
} else {
curRow -= 1;
}
// 每次行走到最下一行或者最上一行,则改变行走方向
if (curRow == numRows - 1 || curRow == 0) {
goingDown = !goingDown;
}
}
StringBuilder result = new StringBuilder();
for (StringBuilder row : rows) {
result.append(row);
}
return result.toString();
}
代码2:时间复杂度O(n)
public String convert(String s, int numRows) {
if (s.length() == 1 || numRows < 2) {
return s;
}
StringBuilder result = new StringBuilder();
int len = s.length();
// 一个循环周期的长度
int cycleLen = 2 * numRows - 2;
for (int i = 0; i < numRows; i ++) {
for (int j = i; j < len; j += cycleLen) {
result.append(s.charAt(j));
// 如果不是首行和末行,则还需要多加一个
if (i > 0 && i < numRows - 1) {
int k = j + cycleLen - 2 * i;
if (k < len) {
result.append(s.charAt(k));
}
}
}
}
return result.toString();
}