6. ZigZag Conversion

最新推荐文章于 2020-03-02 00:02:09 发布

kakitgogogo

最新推荐文章于 2020-03-02 00:02:09 发布

阅读量214

点赞数

分类专栏： leetcode 文章标签： math

本文链接：https://blog.csdn.net/kakitgogogo/article/details/73293465

版权

leetcode 专栏收录该内容

230 篇文章 0 订阅

订阅专栏

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" .

Subscribe to see which companies asked this question.

将字符串纵向的转化成‘zigzag’形式，然后横向输出结果。单纯的找规律的题...使用'01234567890123...'比较容易看出规律。

代码：

class Solution
{
public:
	string convert(string s, int numRows)
	{
		if(numRows <= 1) return s;
		
		string res;
		int step = (numRows - 1) * 2;
		for(int i = 0; i < numRows; ++i)
		{
			if(i == 0 || i == numRows - 1)
			{
				for(int j = i; j < s.size(); j += step)
				{
					res += s[j];
				}	
			} 
			else
			{
				for(int j = i; j < s.size();)
				{
					res += s[j];
					j += step - (i*2);
					if(j >= s.size()) break;
					res += s[j];
					j += (i*2);
				}
			}
		}
		return res;
	}
};