LeetCode-100题(Hot) 17. 电话号码的字母组合 [Java实现] [极速]

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。答案可以按 任意顺序 返回。

给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

示例 1：

输入：digits = "23"
输出：["ad","ae","af","bd","be","bf","cd","ce","cf"]

---

第一眼：递归

第二眼：回溯

先上结果

                        ​​​​​​​        ​​​​​​​

    private static final HashMap<Integer, char[]> KEY_MAP = new HashMap<>(8);

    static {
        KEY_MAP.put(2, new char[] {'a', 'b', 'c'});
        KEY_MAP.put(3, new char[] {'d', 'e', 'f'});
        KEY_MAP.put(4, new char[] {'g', 'h', 'i'});
        KEY_MAP.put(5, new char[] {'j', 'k', 'l'});
        KEY_MAP.put(6, new char[] {'m', 'n', 'o'});
        KEY_MAP.put(7, new char[] {'p', 'q', 'r', 's'});
        KEY_MAP.put(8, new char[] {'t', 'u', 'v'});
        KEY_MAP.put(9, new char[] {'w', 'x', 'y', 'z'});
    }

    public List<String> letterCombinations(String digits) {
        List<String> list = new LinkedList<>();
        int length = digits.length();
        if (length < 1) {
            return list;
        }
        value(0, digits, new StringBuilder(), list);
        return list;
    }

    private static void value(int index, String digits, StringBuilder builder, List<String> list) {
        if (index == digits.length()) {
            list.add(builder.toString());
        } else {
            char[] chars = KEY_MAP.get(digits.charAt(index) - 48);
            for (char aChar : chars) {
                builder.append(aChar);
                value(index + 1, digits, builder, list);
                // builder是同阶下通用的，递归完成后务必删除同级新增字符
                builder.deleteCharAt(index);
            }
        }
    }