问题描述
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”.
分析
这个想通了很简单,把它想成发扑克,正着发完直接反过来发:123212321,
最后依次从1,2,3号人那里取扑克,即答案。现在的问题是拿什么数据结构存储“扑克”呢,先进先出,自然想到队列,运行时间更短的话肯定要用数据的,这里我用的vector。
代码
class Solution {
public:
string convert(string s, int nRows) {
if (nRows == 1)return s;
string ans;
vector<char> *array=new vector<char>[nRows];
int j=0;
int flag = 1;
for (int i = 0; i < s.length(); i++)
{
array[j].push_back(s[i]);
if (flag) { if (j == nRows - 1) { j--; flag = 0; } else j++; }
else { if (j == 0){ j++; flag = 1; } else j--; }
}
for (int i = 0; i < nRows; i++)
{
for (int j = 0; j < array[i].size(); j++)
{
ans+=array[i][j];
}
}
return ans;
}
};