17. 电话号码的字母组合

题目:

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

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

思考：

递归，多加一个字母多加前面的所有可能性+最后一个字母的排列

代码：

 public static List<String> letterCombinations(String digits) {
        Map<String, List<String>> phoneNums = new HashMap<>();
        phoneNums.put("2", Arrays.asList("a","b","c"));
        phoneNums.put("3", Arrays.asList("d","e","f"));
        phoneNums.put("4", Arrays.asList("g","h","i"));
        phoneNums.put("5", Arrays.asList("j","k","l"));
        phoneNums.put("6", Arrays.asList("m","n","o"));
        phoneNums.put("7", Arrays.asList("p","q","r", "s"));
        phoneNums.put("8", Arrays.asList("t","u","v"));
        phoneNums.put("9", Arrays.asList("w","x","y", "z"));
        char[] list = digits.toCharArray();
        if (list.length == 0) {
            return new ArrayList<>();
        }
        List<String> result = new ArrayList<>();
        addList(result, list, list.length, phoneNums);
        return result;
    }

    public static void addList(List<String> list, char[] pn, int i, Map<String, List<String>> phoneNums) {
        if (i == 1) {
            List<String> nums = phoneNums.get(String.valueOf(pn[i-1]));
            list.addAll(nums);
            return;
        }
        addList(list, pn, i-1, phoneNums);
        List<String> nums = phoneNums.get(String.valueOf(pn[i-1]));
        List<String> neoList = new ArrayList<>();
        list.forEach(e -> {
            nums.forEach(n -> {
                neoList.add(e + n);
            });
        });
        list.clear();
        list.addAll(neoList);
    }