ZigZag Conversion

最新推荐文章于 2024-10-24 22:31:46 发布

kai_ITthinker

最新推荐文章于 2024-10-24 22:31:46 发布

阅读量336

点赞数 1

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/kai_ITthinker/article/details/77962868

leetcode 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种将字符串以Z形排列方式写入指定行数的方法，并提供了C++实现代码。该方法首先判断输入字符串长度与行数的关系，然后根据Z形规律填充二维数组，最后按行读取形成最终结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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"

class Solution {
public:
    string convert(string s, int numRows) {
        if ((numRows < 2)
           || (s.size() <= numRows))
        {
            return s;
        }
        int col = s.size()/((2 == numRows) ? (numRows - 1) : (numRows - 2)) + 1;
        char r[numRows][col];
        for (int i = 0; i < col; i++)
        {
            for (int j = 0; j < numRows; j++)
            {
                r[j][i] = 0;
            }
        }
        int index = 0;
        for (int i = 0; i < col; i++)
        {
            if ((0 == (i % 2))
               || (2 == numRows))
            {
                for (int j = 0; (j < numRows) && (index < s.size()); j++)
                {
                    r[j][i] = s.at(index++);
                }
            }
            else
            {
                
                for (int j = (numRows - 2); j > 0 && (index < s.size()); j--)
                {
                    r[j][i] = s.at(index++);
                }
            }
        }
        string result;
        for (int j = 0; j < numRows; j++)
        {
            for (int i = 0; i < col; i++)
            {
                if (r[j][i] != '\0')
                {
                     result.push_back(r[j][i]);
                }              
            }
        }
        
        return result;
    }
};