6. ZigZag Conversion

最新推荐文章于 2025-12-21 17:04:13 发布

转载最新推荐文章于 2025-12-21 17:04:13 发布 · 173 阅读

文章标签：

#algorithms #leetcode #Greedy

algorithms 专栏收录该内容

26 篇文章

订阅专栏

本文介绍了一种算法，该算法将给定的字符串以Z形模式分布在指定数量的行上，并按行读取形成新的字符串。例如，字符串PAYPALISHIRING在3行的Z形分布后变为PAHNAPLSIIGYIR。文中提供了一个C++实现的示例。

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 text, int nRows);

convert("PAYPALISHIRING", 3) should return "PAHNAPLSIIGYIR".

Solution:

class Solution {
public:
string convert(string s, int numRows) {
string *str = new string[numRows];
int row = 0, step = 1;
for (int i = 0; i < s.size(); i++)
{
str[row].push_back(s[i]);
if (row == 0)
{
step = 1;
}
else if (row >= numRows - 1)
{
step = -1;
}
row += step;
}
string cons;
for (int i = 0; i < numRows; i++)
{
cons.append(str[i]);
}
delete[] str;
return cons;
}
};