题目
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:
大意就是给第一个字符串,按照所要求的方式进行排列,求出排列后的字符串
如
Input: s = "PAYPALISHIRING", numRows = 4
Output: "PINALSIGYAHRPI"
Explanation:
P I N
A L S I G
Y A H R
P I
分析
仔细观察排列好的字符串,我们看第一行的每个元素,会发现第k个元素的下标为k * (2 * numRows - 2), 而余下每一行的元素, 而第i行与第一行位于同一列的元素的与标为k * (2 * numRows -2) + i - 1。
而对于2 ~ numRows-1行中不和第一行位于同一列的元素的下边都比它的前一个元素所在的下标大2 * (numRows - i - 1),所以我们就很容易得出每一行元素所在的下标
- 第一行: k * (2 * numRows -2)
- 最后一行: k * (2 * numRows -2) + numRows -1
- 第i行: k * (2 * numRows-2) + i - 1 和 k * 2 * (numRows - 2) + i - 1 + 2 * (numRows - i - 1)
代码
class Solution {
public:
string convert(string s, int numRows) {
if (numRows == 1) return s;
string ret;
int n = s.size();
int cycleLen = 2 * numRows - 2;
for (int i = 0; i < numRows; i++) {
for (int j = i; j < n ; j += cycleLen){
ret += s[j];
if (i != 0 && i != numRows-1 && j + 2 * (numRows - i -1 ) < n ) {
r += s[j + 2 * (numRows - i -1 )]
}
}
}
return ret;
}
};