forked from DengWangBao/Leetcode-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathZigZagConversion.java
43 lines (37 loc) · 983 Bytes
/
ZigZagConversion.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
import java.util.Arrays;
/**
* 这道题一定要注意numRows为1的情况
*/
public class ZigZagConversion {
public String convert(String s, int numRows) {
if (numRows == 1) {
return s;
}
String[] strs = new String[numRows];
Arrays.fill(strs, "");
boolean down = true;
for (int i = 0, k = 0; k < s.length(); k++) {
strs[i] += s.substring(k, k + 1);
if (down) {
if (i < numRows - 1) {
i++;
} else {
i--;
down = false;
}
} else {
if (i > 0) {
i--;
} else {
i++;
down = true;
}
}
}
StringBuilder sb = new StringBuilder();
for (String str : strs) {
sb.append(str);
}
return sb.toString();
}
}