-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path6_ZigZag_Conversion.py
More file actions
58 lines (47 loc) · 1.42 KB
/
Copy path6_ZigZag_Conversion.py
File metadata and controls
58 lines (47 loc) · 1.42 KB
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
"""
https://leetcode.com/problems/zigzag-conversion/
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:
def convert(self, s: 'str', numRows: 'int') -> 'str':
result = ""
if numRows == 1:
result = s
return result
length = len(s)
n = 2*numRows - 2
#遍历每一行
for i in range(numRows):
index = i
#搜索下一个字符
while index < length:
if(i==0 or i==numRows-1):
result += s[index]
index += n
else:
result += s[index]
index += n-2*i
if(index >= length):
break
result += s[index]
index += 2*i
return result
x = Solution()
print(x.convert("A", 1))