1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
| package com.demo.s6;
public 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();
} }
|