LeetCode6:ZigZag Conversion

最新推荐文章于 2020-03-27 20:46:55 发布

huazi0204

最新推荐文章于 2020-03-27 20:46:55 发布

阅读量350

点赞数

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

本文链接：https://blog.csdn.net/huazi0204/article/details/8582149

版权

LeetCode 专栏收录该内容

43 篇文章 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" .

public class Solution {
    public String convert(String s, int nRows) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(nRows == 1)
            return s;
        
        String [] rows = new String[nRows];
        boolean flag = true;
        
        for(int r=0; r<nRows; r++)
            rows[r] = "";
        
        for(int i=0, r=0; i<s.length(); i++){            
            rows[r] += s.charAt(i);

            r = flag? (r+1):(r-1);

            if(r%(nRows-1) == 0)
                flag = !flag;
        }
        
        String res = "";
        for(int i=0; i<nRows; i++)
            res += rows[i];
        return res;
    }
}

This code is slow, should use a better one. Don't use Array of String.

------------------------------------------------------------------------------------------------------------------------------------------
LL's solution:

public class Solution {
    public String convert(String s, int nRows) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(nRows == 1||s.length()<nRows)
            return s;
        int inc = 2*nRows-2;
        String zigzag = "";
        int l = s.length();
        for(int row = 0; row<nRows; row++){
            int index = row;
            int inc2 = inc-2*row;
            while(index<l){
                zigzag += s.charAt(index);
                //if not first or last row, need to add another char
                if(row != 0 && row != nRows-1 && index+inc2<l)
                    zigzag += s.charAt(index+inc2);
                index += inc;
            }
        }
        return zigzag;
    }
}

NOTE: need to check index+inc2<l, otherwise out of range may occur.