17. 电话号码的字母组合

class Solution {

    private static final Map<Character, String> map = new HashMap<>();

    static {
        map.put('2', "abc");
        map.put('3', "def");
        map.put('4', "ghi");
        map.put('5', "jkl");
        map.put('6', "mno");
        map.put('7', "pqrs");
        map.put('8', "tuv");
        map.put('9', "wxyz");
    }

    public List<String> letterToStrList(char ch) {
        List<String> ans = new ArrayList<>();
        String s = map.get(ch);
        for (int i = 0; i < s.length(); i++) {
            ans.add(String.valueOf(s.charAt(i)));
        }
        return ans;
    }

    public List<String> letterCombinations(String digits) {
        if (digits == null || digits.length() == 0) {
            return new ArrayList<>();
        }
        List<String> ans = letterToStrList(digits.charAt(0));
        if (digits.length() == 1) {
            return ans;
        }
        for (int i = 1; i < digits.length(); i++) {
            String s = map.get(digits.charAt(i));
            List<String> tmpAns = new ArrayList<>();
            for (String an : ans) {
                for (int k = 0; k < s.length(); k++) {
                    tmpAns.add(an + s.charAt(k));
                }
            }
            ans = tmpAns;
        }
        return ans;
    }
}