-
Notifications
You must be signed in to change notification settings - Fork 0
/
6.zigzag-conversion.cpp
70 lines (70 loc) · 1.36 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
/*
* [6] ZigZag Conversion
*
* https://leetcode.com/problems/zigzag-conversion/description/
*
* algorithms
* Medium (27.51%)
* Total Accepted: 210.9K
* Total Submissions: 765.8K
* Testcase Example: '"PAYPALISHIRING"\n3'
*
* 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:
string convert(string s, int numRows) {
int n = s.size();
int k = 0;
string ans;
if (numRows == 1) return s;
int curRow = 0;
string v[numRows];
for (int i = 0; i < n; i++) {
v[curRow].push_back(s[i]);
if (curRow == numRows-1) k = -1;
else if (curRow == 0) k = 1;
k == 1 ? curRow++ : curRow--;
}
for (int i = 0; i < numRows; i++) {
ans += v[i];
}
return ans;
}
};