Leetcode: ZigZag Conversion

最新推荐文章于 2024-10-05 12:29:44 发布

店小不2

最新推荐文章于 2024-10-05 12:29:44 发布

阅读量527

点赞数

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

本文链接：https://blog.csdn.net/xiaoxixixiyang/article/details/40426223

版权

Leetcode 专栏收录该内容

119 篇文章 0 订阅

订阅专栏

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

This can be done mathematically. Note the step 2(nRows - 1). O(n) time and O(1) space. Code is as follows:

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

Can also use an string array of size nRows, for less computation. Put the characters in the nRows strings in a zigzag order, and concatenate them. This requires O(n) time and O(nRows) space.

public class Solution {
    public String convert(String s, int nRows) {
        if (s == null || s.length() == 0) {
            return s;
        }
        
        StringBuilder[] sbs = new StringBuilder[nRows];
        for (int i = 0; i < nRows; i++) {
        	sbs[i] = new StringBuilder();
        }
        int pos = 0;
        boolean topDown = true;
        for (int i = 0; i < s.length(); i++) {
            sbs[pos].append(s.charAt(i));
            if (nRows != 1) {
            	if (topDown) {
            		pos++;
            	} else {
            		pos--;
            	}
            }
            if (pos == nRows - 1) {
                topDown = false;
            } else if (pos == 0) {
                topDown = true;
            }
        }
        
        StringBuilder res = new StringBuilder();
        for (int i = 0; i < nRows; i++) {
            res.append(sbs[i]);
        }
        
        return res.toString();
    }
}