ZigZag Conversion

最新推荐文章于 2025-05-22 17:48:42 发布

原创最新推荐文章于 2025-05-22 17:48:42 发布 · 333 阅读

0 ·

CC 4.0 BY-SA版权

leetCode 同时被 2 个专栏收录

39 篇文章

订阅专栏

字符串

4 篇文章

订阅专栏

本文介绍了一种将字符串以Z形排列方式写入指定行数的方法，并提供了C++实现代码。该方法首先按行读取Z形排列的字符串，然后通过特定算法将其转换为一行连续的字符串。

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 nRows) 
	{
		string str;
		if(!s.size() || nRows <= 0)return str;
		if(s.size() <= nRows)return s;
		ostringstream os;
		for(int r = 0; r < nRows; r++)
		{
			int c = 1,idx = r;
			os << s[idx];
			int ood_step = 2 * (nRows - r) - 2;
			int even_step = 2 * (r + 1) - 2;
			if(!ood_step && !even_step)ood_step = 1;
			while(idx < s.size())
			{
				

				if(ood_step && idx + ood_step < s.size())os<< s[idx + ood_step];
				if(even_step && idx + ood_step + even_step < s.size())os<< s[idx + even_step + ood_step];
				idx += even_step + ood_step;
			}
		}
		return os.str();
			
	}	
    
};