forked from algorhythms/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
006 ZigZag Conversion.py
49 lines (39 loc) · 1.29 KB
/
006 ZigZag Conversion.py
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
"""
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".
"""
__author__ = 'Danyang'
class Solution:
def convert(self, s, nRows):
"""
Algorithm: matrix
:param s:
:param nRows:
:return: a String
"""
length = len(s)
matrix = [[] for _ in xrange(nRows)]
i = 0
while i < length:
try:
# going down
for j in xrange(nRows):
matrix[j].append(s[i])
i += 1
# going up
for j in xrange(nRows-1-1, 0, -1):
matrix[j].append(s[i])
i += 1
except IndexError:
break
lst = ["".join(element) for element in matrix]
return "".join(lst)
if __name__ == "__main__":
assert Solution().convert("ABCD", 2) == "ACBD"