ZigZag Conversion

寻找W型字符的规律：除第一和最后一行外都是对称的。找出循环的长度相应的做出位移即可。比较烦

public class Solution {
    public String convert(String s, int nRows) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(nRows == 1)
            return s;
        char[] mychar = s.toCharArray();
        char[] result = new char[mychar.length];
        int rows = 2 * nRows - 2;
        int index = 0;
        for(int i = 1; i < nRows + 1; i++)
        {
            int start = i - 1;
            boolean odd = true;
            while(start < result.length){
                result[index] = mychar[start];
                if(i == 1 || i == nRows)
                    start += rows;
                else if(odd)
                {
                    start += rows - 2 * i + 2;
                    odd = false;
                }
                else
                {
                    start += 2 * i - 2;
                    odd = true;
                }
                index++;
            }
        }
        return String.valueOf(result);
        
    }
}