[leetcode]6. ZigZag Conversion(Java)

最新推荐文章于 2024-09-22 04:59:47 发布

JacobGo

最新推荐文章于 2024-09-22 04:59:47 发布

阅读量455

点赞数

分类专栏： leetcode 文章标签： ZigZag Conversion leetcode

本文链接：https://blog.csdn.net/zjkC050818/article/details/74390416

版权

leetcode 专栏收录该内容

130 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/zigzag-conversion/#/description

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

题意解析：

把给定的字符串进行重新排列，排成齿轮状。通过图像来解释会更直观

Java Code:

package go.jacob.day705;

public class Demo3 {
	public String convert(String s, int numRows) {
		if (s == null || s.length() < numRows)
			return s;
		StringBuffer[] sb = new StringBuffer[numRows];
		for (int i = 0; i < numRows; i++) {
			sb[i] = new StringBuffer();
		}

		char[] c = s.toCharArray();
		int len = s.length();
		int index = 0;
		while (index < len) {
			for (int i = 0; i < numRows && index < len; i++) {
				sb[i].append(c[index++]);
			}
			for(int i=numRows-2;i>0&& index < len;i--){
				sb[i].append(c[index++]);
			}
		}
		
		for(int i=1;i<numRows;i++){
			sb[0].append(sb[i]);
		}
		return sb[0].toString();
	}
}