[LeetCode]ZigZag Conversion

来源：互联网发布：测量软件手机版编辑：程序博客网时间：2024/06/08 17:58

题目：点击打开链接

public class Solution {    public String convert(String s, int numRows) {        if (1 >= numRows) {            return s;        }                int length = s.length();        char[] array = new char[length];                int base = (numRows - 1) * 2;        int[] data = new int[2];                int index = 0;        for (int i=0; i<numRows; i++) {            data[1] = i * 2;            data[0] = base - data[1];            if (0 == data[0]) {                data[0] = base;            }                        if (0 == data[1]) {                data[1] = base;            }                        int temp = i;            int flag = 0;            while ((temp < length) && (index < length)) {                array[index] = s.charAt(temp);                index = index + 1;                temp = temp + data[flag];                flag = (flag + 1) % 2;            }        }                return String.copyValueOf(array);    }}

0 0