44 lines
1.2 KiB
Java
44 lines
1.2 KiB
Java
|
package com.zerroi.leetcode.Three15;
|
|||
|
|
|
|||
|
|
import java.util.ArrayList;
|
|||
|
|
import java.util.List;
|
|||
|
|
|
|||
|
|
/*
|
|||
|
|
* 将一个给定字符串 s 根据给定的行数 numRows ，以从上往下、从左到右进行 Z 字形排列。
|
|||
|
|
|
|||
|
|
比如输入字符串为 "PAYPALISHIRING" 行数为 3 时，排列如下：
|
|||
|
|
|
|||
|
|
P A H N
|
|||
|
|
A P L S I I G
|
|||
|
|
Y I R
|
|||
|
|
之后，你的输出需要从左往右逐行读取，产生出一个新的字符串，比如："PAHNAPLSIIGYIR"。
|
|||
|
|
|
|||
|
|
请你实现这个将字符串进行指定行数变换的函数：
|
|||
|
|
|
|||
|
|
string convert(string s, int numRows);
|
|||
|
|
* */
|
|||
|
|
public class Convert {
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
class SolutionFirst {
|
|||
|
|
public String convert(String s, int numRows) {
|
|||
|
|
if (numRows < 2) return s;
|
|||
|
|
List<StringBuilder> list = new ArrayList<>();
|
|||
|
|
for (int i = 0; i < numRows; i++) {
|
|||
|
|
list.add(new StringBuilder());
|
|||
|
|
}
|
|||
|
|
int flag = -1, i = 0;
|
|||
|
|
for (char c : s.toCharArray()) {
|
|||
|
|
list.get(i).append(c);
|
|||
|
|
if (i == 0 || i == numRows - 1) flag = -flag;
|
|||
|
|
i += flag;
|
|||
|
|
}
|
|||
|
|
StringBuilder res = new StringBuilder();
|
|||
|
|
for (StringBuilder builder : list) {
|
|||
|
|
res.append(builder);
|
|||
|
|
}
|
|||
|
|
return res.toString();
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|