[LeetCode]6. ZigZag Conversion（自学留存）

原创于 2018-02-28 13:07:44 发布 · 158 阅读

CC 4.0 BY-SA版权

本文介绍了一种将字符串以Z形方式分布在多行上的算法，并提供了C++实现代码。该算法将输入字符串按Z形模式排列后，再按行读取并输出。例如，将PAYPALISHIRING以3行Z形排列后读取，输出为PAHNAPLSIIGYIR。

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

Personal Tips: 将z形拆分为两部分轮流读写入string类型的数组中，最后将数组连接并返回，代码如下：

class Solution {
public:
	string convert(string s, int numRows) {
		if (numRows == 1) return s;
		string *a = new string[numRows];
		for (int i = 0; i < s.size();)
		{
			int count = 0;
			while (count<(numRows - 1)&& i < s.size())
			{
				a[count++].push_back(s[i++]);
			}
			while (count>0 && i < s.size())
			{
				a[count--].push_back(s[i++]);
			}
		}
		string news; int i = 0;
		while (i<numRows)
		{
			news += a[i++];
		}
		return news;
	}
};