Zigzag Conversion_Leetcode_#6

1.题目
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”.

2.解法
思路：定义numRows个StringBuilder，每一个用来存放一行字符，使用前初始化。用index标记StringBuilder，第一行的index为0，最后一行的index为numRows-1；用incre标记index应该加一还是减一，从上到下是加一，从下往上应该减一，上下的方向可以通过判断index为0还是numRows-1而得出。遍历一次str即可，之后把StringBuilder数组的内容合并到一起就得到结果。

时间复杂度为O(N)

public class Solution {
    public String convert(String str, int numRows){
        if(str == null){
            return null;
        }
        if(numRows <= 1){
            return str;
        }
        int len = str.length();
        boolean flag = false;
        StringBuilder [] sB = new StringBuilder[numRows];
        for(int i = 0; i < sB.length; i++){
            sB[i] = new StringBuilder("");
        }
        int index = 0;
        int incre = 0;
        for(int j = 0; j < len; j++){
            sB[index].append(str.charAt(j));
            if(index == 0){
                incre = 1;
            }
            if(index == numRows - 1){
                incre = -1;
            }
            index += incre;
        }
        String strRes = "";
        for(int k = 0; k < sB.length; k++){
            strRes += sB[k];
        }
        return strRes;  
    }
}