leetcode-0006-ZigZag Conversion(Z字型变换)

题目

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

解题

方法1

1. 仔细看输出内容发现是曲折前进的，按照Z字型输出
2. 如果把空格去掉，我们可以定义 List list，大小是numRows-1，用于存放每行的字符

P I N
A L S I G
Y A H R
P I

3. 再看输出顺序,可以判断出：
   （1）当row==0时，从↑变换成↓，
   （2）当row=numRows-1时，从↓变换成↑

↓P      I↓     N↓
↓A   ↑L S↓  ↑I G↓
↓Y ↑A   H↓ ↑R
↓P      I↓

boolean goDown = false;
if (curRow == 0 || curRow == numRows -1) {
    goDown = !goDown;
}

整体代码：

public static String zigzag(String s, int numRows) {
    if (numRows <= 1) {
      return s;
    }

    boolean goDown = false;
    List<StringBuilder> list = new ArrayList<>();
    for (int i = 0; i < numRows; i++) {
      list.add(new StringBuilder());
    }

    int curRow = 0;
    for (char c : s.toCharArray()) {
      list.get(curRow).append(c);

      if (curRow == 0 || curRow == numRows -1) {
        goDown = !goDown;
      }
      curRow += goDown ? 1 : -1;
    }

    StringBuilder sb = new StringBuilder();
    for (StringBuilder ss : list) {
      sb.append(ss);
    }
    return sb.toString();
  }

参考资料：
https://leetcode.com/problems/zigzag-conversion/solution/