17. Letter Combinations of a Phone Number

题目：Letter Combinations of a Phone Number 电话号码的数字组合

难度：中等

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

Example:

Input: "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

Note:

Although the above answer is in lexicographical order, your answer could be in any order you want.

题意解析：

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。

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

示例:

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

说明:
尽管上面的答案是按字典序排列的，但是你可以任意选择答案输出的顺序。

解题思路一：

遍历每一个数字，将当前数字对应的字母与上一个数字得到的list再次进行组合，让list指向这个新的list，所以在刚开始的时候，我们需要初始化一个空的字符串进去，list.add(0,""),第一次2进来，然后让2所对应的a、b、c与空字符串进行组合，只有三种结果a、b、c；然后将a、b、c这个组合赋值给list，下次3进来，将3对应的d、e、f与list中的a、b、c进行组合，就可得到ad、ae、af、bd、be、bf、cd、ce、cf这几种组合。如果有很多数字那么就依照此方法类推就行了。

public List<String> letterCombinations(String digits) {
        String[] map = new String[] {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        int n = digits.length();
        LinkedList<String> list = new LinkedList<>();
        if (digits.isEmpty())
            return list;
        list.add(0,"");
        for (int i = 0; i < n; i++) {
            int x = Character.getNumericValue(digits.charAt(i));
            int size = list.size();
            LinkedList<String> temp = new LinkedList<>();
            for (int j = 0; j < size; j++) {
                for (char s : map[x].toCharArray())
                temp.add(list.get(j)+ s);
            }
            list = temp;
        }

        return list;
    }

算法时间复杂度O(n²)

提交代码之后：

Runtime: 1 ms, faster than 90.72% of Java online submissions for Letter Combinations of a Phone Number.

Memory Usage: 37.1 MB, less than 83.64% of Java online submissions for Letter Combinations of a Phone Number.