LeetCode 刷题之 ZigZag Conversion

本文介绍了一种将字符串以ZigZag形式排列并按行读取的算法实现。该算法通过特定的循环和条件判断,实现了字符串PAYPALISHIRING在指定行数下的ZigZag模式转换,最终返回转换后的字符串。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

LeetCode 刷题之 ZigZag Conversion

/**
 * @Time : 18/03/2018 15:59
 * @Author : lotus
 * @File : ZigzagPattern.java
 * @Software: IntelliJ IDEA
 * @Desc :
 * @license : Copyright(C), Alex
 * @Contact : alex.cs.monash@gmail.com
 */

import java.util.Scanner;

/**
 * Question: ZigZag Conversion
 * 
 * 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 ZigzagPattern {

    public String convert(String s, int numRows) {
        if (s == null || s.length() == 0 || numRows <= 1 || s.length() <= numRows) {
            return s;
        }

        final int batch = 2 * numRows - 2;
        final int length = s.length();
        final char[] chars = s.toCharArray();
        StringBuilder output = new StringBuilder(length);
        for (int i = 0; i < length; i += batch) {
            output.append(chars[i]);
        }

        for (int i = 1; i < numRows - 1; i++) {
            for (int j = 0; j + i < length; j += batch) {
                output.append(chars[j + i]);
                if (j + batch - i < length) {
                    output.append(chars[j + batch - i]);
                }
            }
        }

        for (int i = numRows - 1; i < length; i += batch) {
            output.append(chars[i]);
        }

        return output.toString();
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.next();
        int rows = Integer.parseInt(scanner.next());
        ZigzagPattern zigzag = new ZigzagPattern();
        System.out.println(zigzag.convert(input, rows));

    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值