leetcode刷题笔记-ZigZag Conversion

问题描述：

The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)

And then read line by line: “PAHNAPLSIIGYIR”
Write the code that will take a string and make this conversion given a number of rows:

string convert(string text, int nRows);
convert(“PAYPALISHIRING”, 3) should return “PAHNAPLSIIGYIR”.

这道题就是把给定的字符串按照给定的行数，排列成锯齿状，然后行输出。

解答思路：
这道题的重点在于怎样将给定的字符串分配到存储每一行字符的list中，可以按照每组（numbows-1）个字符将字符串分成组，偶数组从第0行到第numbows-2行遍历插入一个字符，奇数组，从numbows-1到第1行遍历插入一个字符串，然后再考虑最后一个不足（numbows-1）个字符的分组。

public class Solution {
    public String convert(String s, int numbows) {
        int length = s.length();
        if (length <= numbows) {
            return s;
        }
        if (numbows == 1) {
            return s;
        }
        Map<Integer, List<Character>> map = new HashMap<>();
        for(int i=0;i<numbows;i++){
            map.put(i,new ArrayList<>());
        }
        int n = length / (numbows - 1);
        int m = length % (numbows - 1);
        for (int j = 0; j < n; j++) {
            if (j % 2 != 0) {
                for (int k = numbows - 1; k > 0; k--) {
                    map.get(k).add(s.charAt((numbows - 1) * j + (numbows - 1 - k)));
                }
            } else {
                for (int k = 0; k < numbows-1; k++) {
                    map.get(k).add(s.charAt((numbows - 1) * j + k));
                }
            }
        }
        if (m != 0) {
            if (n % 2 != 0) {
                for (int k = numbows - 1; k > numbows - 1 - m; k--) {
                    map.get(k).add(s.charAt((numbows - 1) * n + (numbows - 1 - k)));
                }
            } else {
                for (int k = 0; k < m; k++) {
                    map.get(k).add(s.charAt((numbows - 1) * n + k));
                }
            }
        }
        StringBuffer sb = new StringBuffer();
        for (int i = 0; i < numbows; i++) {
            Iterator<Character> it = map.get(i).iterator();
            while (it.hasNext()) {
                sb.append(it.next());
            }
        }
        return sb.toString();

    }
}