ZigZag Conversion

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

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

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种将字符串以Z形方式排列并按行读取的算法实现。该算法接受一个字符串和行数作为输入参数，返回经过Z形转换后的字符串。通过使用字符串数组来模拟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".

public class Solution {
    public String convert(String s, int numRows) {
        String[] v = new String[numRows];
		Arrays.fill(v, 0, numRows, "");
		for (int i = 0; i < s.length();) {
			for (int j = 0; i < s.length() && j < numRows; ++i, ++j)
				v[j] += s.charAt(i);
			for (int j = numRows - 2; i < s.length() && j > 0; ++i, --j)
				v[j] += s.charAt(i);
		}
		String res = "";
		for (int i = 0; i < numRows; ++i)
			res += v[i];
		return res;
    }
}