6. ZigZag Conversion

Difficulty:
Related Topics:
Similar Questions:

    Problem

    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 s, int numRows);
    

    Example 1:

    Input: s = "PAYPALISHIRING", numRows = 3
    Output: "PAHNAPLSIIGYIR"
    

    Example 2:

    Input: s = "PAYPALISHIRING", numRows = 4
    Output: "PINALSIGYAHRPI"
    Explanation:
    
    P     I    N
    A   L S  I G
    Y A   H R
    P     I
    

    Solution (Java)

    class Solution {
        public String convert(String s, int numRows) {
            if(numRows<=1)return s;
            StringBuilder[] sb=new StringBuilder[numRows];
            for(int i=0;i<sb.length;i++){
                sb[i]=new StringBuilder("");//init every sb element *important steps!!!
            }
            int incre=1;
            int index=0;
            for(int i=0;i<s.length();i++){
                sb[index].append(s.charAt(i));
                if(index==0){incre=1;}
                if(index==numRows-1){incre=-1;}
                index+=incre;
            }
            String re="";
            for(int i=0;i<sb.length;i++){
                re+=sb[i];
            }
            return re.toString();
        }
    }
    
    

    Solution (Javascript)

    /**
     * @param {string} s
     * @param {number} numRows
     * @return {string}
     */
    var convert = function(s, numRows) {
      if (s.length <= numRows || numRows < 2) return s;
      var len = s.length;
      var num = 2 * (numRows - 1);
      var res = Array(numRows).fill('');
      var tmp = 0;
      for (var i = 0; i < len; i++) {
        tmp = i % num;
        if (tmp < numRows) {
          res[tmp] += s[i];
        } else {
          res[num - tmp] += s[i];
        }
      }
      return res.join('');
    };
    

    Explain:

    曲线每 2 * (numRows - 1) 个数按规律出现。

    Complexity: