LeetCode | 6. ZigZag Conversion

最新推荐文章于 2021-03-20 20:07:40 发布

1LOVESJohnny

最新推荐文章于 2021-03-20 20:07:40 发布

阅读量150

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/iLOVEJohnny/article/details/83592710

LeetCode 专栏收录该内容

285 篇文章

订阅专栏

本文介绍了一种将字符串以Z字形模式分布在指定行数上的算法，并按行读取形成的字符串。通过实例展示了如何使用C++实现这一转换，包括不同行数下字符串的变化。

摘要生成于 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 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 {
public:
    string convert(string s, int numRows) {
        string output = "";
		if(numRows == 1)
			return s;
		for(int i = 0; i<numRows; i++)
		{
			int idx = i;
			while(idx < s.length())
			{
				output += s[idx];
				if(i == 0 || i == numRows - 1)
				{
					idx += (numRows - 1)*2;
				}
				else
				{
					idx += (numRows - 1 - i) * 2;
					if(idx < s.length())
						output += s[idx];
					idx += i * 2;
				}
			}
		}
		return output;
    }
};