ZigZag Conversion

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

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

CC 4.0 BY-SA版权

本文介绍了一个将字符串转换为zigzag模式的算法，并通过示例代码进行演示。zigzag模式是一种在指定行数下将字符串以斜线状排列并逐行读取的方式。

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

package String;

/**
 * @Title: ZigZag_Conversion.java
 * @Package String
 * @Description: TODO
 * @author nutc
 * @date 2013-8-28 上午9:40:59
 * @version V1.0
 */
public class ZigZag_Conversion {

	public static void main(String args[]) {
		ZigZag_Conversion l = new ZigZag_Conversion();
		String s = "dskbrfmxkbfemuxrvmarsketqpelrcbxulyoqklcnqgbkdtirvb";
		System.out.println(l.convert(s, 10));// PINALSIGYAHRPI
	}

	public String convert(String s, int nRows) {

		if (s == null || nRows <= 0)
			return null;
		if (nRows == 1)
			return s;

		int key = (nRows - 1) * 2;

		StringBuilder sb = new StringBuilder();
		int x = key, y = 0;
		for (int i = 0; i < nRows && i < s.length(); i++) { // 考虑'A' 2
			sb.append(s.charAt(i));
			int j = i;
			while (j < s.length()) {
				j += x;
				if (x > 0 && j < s.length()) {
					// System.out.println(j + " x" + x + "  " + s.charAt(j));
					sb.append(s.charAt(j));
				}
				j += y;
				if (y > 0 && j < s.length()) {

					// System.out.println(j + " y" + y + "  " + s.charAt(j));
					sb.append(s.charAt(j));
				}
			}
			x -= 2;
			y += 2;
		}
		return sb.toString();
	}
}