Leetcode: 6. ZigZag Conversion(JAVA)

最新推荐文章于 2022-10-11 21:03:23 发布

那莫名

最新推荐文章于 2022-10-11 21:03:23 发布

阅读量272

点赞数

分类专栏： Leetcode 文章标签： leetcode java

本文链接：https://blog.csdn.net/u010183658/article/details/50930601

版权

Leetcode 专栏收录该内容

68 篇文章 1 订阅

订阅专栏

【问题描述】

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);

【思路】

第0行和最后一行中，前一个下标的值和后一个下标的值相差 2 * nRows - 2

每行后所接的数字序号为2 * (nRows - 1 - i)

【code】

public class Solution {
    public String convert(String s, int numRows) {
		if (s == null || s.length() < 0 || numRows <= 0) {
			return "";
		}
		if (numRows == 1) {
			return s;
		}
		StringBuffer sb = new StringBuffer();
		int size = numRows * 2 - 2;
		for (int i = 0; i < numRows; i++) {
			for (int j = i; j < s.length(); j += size) {
				sb.append(s.charAt(j));
				if (i != 0 && i != numRows - 1) {
					int temp = j + size - 2 * i;
					if (temp < s.length()) {
						sb.append(s.charAt(temp));
					}
				}
			}
		}
		return sb.toString();        
    }
}