LeetCode 6. ZigZag Conversion(之字形)

8 篇文章 0 订阅
7 篇文章 0 订阅

原题网址:https://leetcode.com/problems/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 Solution {
    public String convert(String s, int numRows) {
        if (numRows <= 1) return s;
        char[] sa = s.toCharArray();
        char[] zz = new char[sa.length];
        int zzpos = 0;
        int blockSize = numRows * 2 - 2;
        for(int row = 0; row < numRows; row ++) {
            for(int pos = row; pos < sa.length; pos += blockSize) {
                zz[zzpos++] = sa[pos];
                int m = pos + (numRows - 1 - row) * 2;
                if (row > 0 && row < numRows-1 && m < sa.length) zz[zzpos++] = sa[m];
            }
        }
        return new String(zz);
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值