题目描述
将一个给定字符串 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);
示例 1:
输入:s = "PAYPALISHIRING", numRows = 3
输出:"PAHNAPLSIIGYIR"
示例 2:
输入:s = "PAYPALISHIRING", numRows = 4
输出:"PINALSIGYAHRPI"
解释:
P I N
A L S I G
Y A H R
P I
示例 3:
输入:s = "A", numRows = 1
输出:"A"
提示:
1 <= s.length <= 1000
s 由英文字母(小写和大写)、',' 和 '.' 组成
1 <= numRows <= 1000
我好像是个智障
class Solution {
public static String convert(String s, int numRows) {
String[] strs = new String[numRows];
if(s == null )return "";
if(numRows == 0) return s;
Arrays.fill(strs,"");
int indexOfS =0;
while(indexOfS < s.length()){
int indexOfRow =0;
int down = numRows;
while(down > 0){
if(indexOfS < s.length()) strs[indexOfRow] += s.substring(indexOfS,indexOfS+1);
else break;
indexOfS++;
indexOfRow++;
down--;
}
if(indexOfS>=s.length()) break;
indexOfRow-=2;
int up = numRows-2;
while(up>0){
if(indexOfS < s.length()) strs[indexOfRow] += s.substring(indexOfS,indexOfS+1);
else break;
indexOfS++;
indexOfRow--;
up--;
}
}
String re = "";
for(String a:strs){
re +=a;
}
return re;
}
}
按顺序遍历string
StringBuilder 要比直接的String+ 快一倍的时间
class Solution {
public String convert(String s, int numRows) {
if (numRows == 1) return s;
List<StringBuilder> rows = new ArrayList<>();
for (int i = 0; i < Math.min(numRows, s.length()); i++) rows.add(new StringBuilder());
int curRow = 0;
boolean goingDown = false;
for (char c : s.toCharArray()) {
rows.get(curRow).append(c);
if(curRow == 0 || curRow == numRows-1) goingDown = !goingDown;
curRow += goingDown ? 1 : -1;
}
StringBuilder ret = new StringBuilder();
for (StringBuilder row : rows) ret.append(row);
return ret.toString();
}
}
按行来添加 完成第一行在添加第二行的内容
没看懂
class Solution {
public String convert(String s, int numRows) {
if (numRows == 1) return s;
StringBuilder ret = new StringBuilder();
int n = s.length();
int cycleLen = 2 * numRows - 2;
for (int i = 0; i < numRows; i++) {
for (int j = 0; j + i < n; j += cycleLen) {
ret.append(s.charAt(j + i));
if (i != 0 && i != numRows - 1 && j + cycleLen - i < n)
ret.append(s.charAt(j + cycleLen - i));
}
}
return ret.toString();
}
}
作者:LeetCode
链接:https://leetcode-cn.com/problems/zigzag-conversion/solution/z-zi-xing-bian-huan-by-leetcode/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。