题目: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”.
理解:就是将输入字符按“Z”字排列,然后一行一行地输出。这是目前为止花时间和脑力最多的一道题了,刚开始想用二维数组解决,发现相当复杂,后来发现,关键在于发现规律。
画一张图解释一下:
public class Solution {
public String convert(String s, int numRows) {
if (numRows == 1) {
return s;
}
int len = s.length();
if (len == 0 || len < numRows) {
return s;
}
char[] sArray = s.toCharArray();
char[] newArray = new char[len];
// 最少要有n列全字符,使得可以包含的字符数>=输入字符数,n从0开始
int n = 0;
while (true) {
int tempIndex = (2 * n) * (numRows - 1);
n++;
if (tempIndex >= len) {
break;
}
}
int index = 0;
// 输出第m行的字符,m从0开始,小于numsRow
int lastRow = numRows - 1;
for (int m = 0; m < numRows; m++) {
for (int tempN = 0; tempN < n; tempN++) {
int tempIndex = (2 * tempN) * (numRows - 1);
if (m == 0) {
// 此时是第0行,输出枢纽就行了
if (tempIndex >= 0 && tempIndex <len) {
newArray[index] = sArray[tempIndex];
index++;
}
} else if (m == lastRow) {
// 此时是最后一行,输出枢纽就行了
tempIndex += lastRow;
if (tempIndex >= 0 && tempIndex <len) {
newArray[index] = sArray[tempIndex];
index++;
}
} else {
int leftIndex = tempIndex - m;
int rightIndex = tempIndex + m;
if (leftIndex >= 0 && leftIndex <len) {
newArray[index] = sArray[leftIndex];
index++;
}
if (rightIndex >= 0 && rightIndex < len) {
newArray[index] = sArray[rightIndex];
index++;
}
}
}
}
return new String(newArray);
}
}