6. ZigZag Conversion

最新推荐文章于 2023-12-09 16:08:49 发布

niunc

最新推荐文章于 2023-12-09 16:08:49 发布

阅读量65

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/niunc/article/details/80395090

版权

LeetCode 专栏收录该内容

185 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/zigzag-conversion/description/

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);

Input: s = "PAYPALISHIRING", numRows = 3
Output: "PAHNAPLSIIGYIR"

The idea is just clear: use numRows character strings to record characters in each row. Traverse the original string s, we need to know which direction are we going, up or down, use True or False to represent this status. Finally, merge all rows.

class Solution(object):
    def convert(self, s, numRows):
        """
        :type s: str
        :type numRows: int
        :rtype: str
        """
        if numRows == 1 or numRows >= len(s):
            return s
        rows = ['' for _ in range(numRows)]
        curr = [0, True]
        for char in s:
            rows[curr[0]] += char
            if curr[1]:
                curr[0] += 1
            else:
                curr[0] -= 1
            if curr[0] == 0:
                curr[1] = True
            if curr[0] == numRows - 1:
                curr[1] = False
        return ''.join(rows)