Zigzag Conversion — LeetCode 6 Python Solution
- Problem
- #6
- Pattern
- Hash Map
- Reading time
- 2 min
- Source
- leetcode.com
The problem
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);
This statement is abridged. Read the full problem on LeetCode.
Example
P A H N A P L S I I G Y I R
Python solution
class Solution:
def convert(self, s: str, numRows: int) -> str:
if numRows == 1:
return s
g = [[] for _ in range(numRows)]
i, k = 0, -1
for c in s:
g[i].append(c)
if i == 0 or i == numRows - 1:
k = -k
i += k
return ''.join(chain(*g))Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(n), where n is the length of the string s auxiliary |
Pattern: Hash Map
Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 6. Zigzag Conversion is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.
The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.
Related problems
On a study list
This problem is on Top Interview 150.
Frequently asked questions
- How hard is LeetCode 6. Zigzag Conversion?
- LeetCode 6. Zigzag Conversion is rated Medium on LeetCode.
- What is the time complexity of LeetCode 6. Zigzag Conversion?
- The Python solution on this page runs in O(n).
- What is the space complexity of LeetCode 6. Zigzag Conversion?
- The Python solution on this page uses O(n), where n is the length of the string s auxiliary space.
- What topics does LeetCode 6. Zigzag Conversion cover?
- LeetCode 6. Zigzag Conversion is tagged String on LeetCode.