-
Notifications
You must be signed in to change notification settings - Fork 1
/
6_Zigzag_Conversion.cpp
84 lines (74 loc) · 2.15 KB
/
6_Zigzag_Conversion.cpp
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include <iostream>
#include <string>
/**
* @brief The Solution class
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
*/
class Solution {
public:
std::string convert(std::string s, int numRows) {
std::string res;
if(s.length() <= numRows || numRows == 1)
return s;
size_t len = s.length();
int circle = (numRows - 1) << 1;
size_t times = len / circle;
numRows--;
for(size_t i=0; i<=times; i++)
{
res.push_back(s.at(i * circle));
}
for(size_t j=1, index=0; j<numRows; j++)
{
for(size_t i=0; i<=times; i++)
{
index = i * circle + j;
if(index < len)
{
res.push_back(s.at(index));
}
index = (i + 1) * circle - j;
if(index < len)
{
res.push_back(s.at(index));
}
}
}
for(size_t i=0; i<times; i++)
{
res.push_back(s.at(i * circle + numRows));
}
if(times * circle + numRows < len)
res.push_back(s.at(times * circle + numRows));
return res;
}
void test(std::string &str, int numRows)
{
std::cout << str << "->" << convert(str, numRows) << std::endl;
}
};
int main()
{
std::string str = "ABCD";//"PAYPALISHIRING";//"ABCD"
int numRows = 2;//3//4//2
Solution example;
example.test(str, numRows);//"PAHNAPLSIIGYIR"//"PINALSIGYAHRPI"//"ACBD"
return 0;
}