题目:
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
思路:
找规律嘛,就是找每个转换后对应的位置。
代码:
char * convert(char * s, int numRows){
int len = 0;
while (s[len] != '\0')
{
len++;
}
char *res = (char*)malloc(len+1);
int num = 0;
int line = 0;
int inter = 0;
int next = 0;
int pos = 0;
if(numRows ==1)
{
return s;
}
while (num < len)
{
int temp = numRows - line;
inter = (temp) * 2 - 2;
next = 2 * line;
pos = line;
while (num < len && pos < len && inter != 0)
{
res[num] = s[pos];
num++;
pos = pos + inter;
if (line != 0 && pos < len &&num < len)
{
res[num] = s[pos];
num++;
pos = pos + next;
}
}
while (inter == 0 && pos < len)
{
res[num] = s[pos];
num++;
pos = pos + next;
}
line++;
}
res[len] = '\0';
return res;
}
效率:
只能说这个直观的找规律效率还行,应该优化一下