力扣题17电话号码的字母组合

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

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

示例 1：

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

示例 2：

输入：digits = ""
输出：[]

示例 3：

输入：digits = "2"
输出：["a","b","c"]

1.自己的解法：利用回溯递归的思想，逐个遍历每个数字可能代表的字符。

class Solution {
    public List<String> letterCombinations(String digits) {
        List<String> listString = new ArrayList<>();
        //如果长度为0的话
        if(digits.length() == 0){
            return listString;
        }

        StringBuffer stringBuffer = new StringBuffer();//要拼接的字符
        appendString(digits,0,listString,stringBuffer);
        return listString;
    }   

    /*
        digits:数字字符串
        index:当前遍历到的字符串的下标
        listString:当前集合
        stringBuffer:当前拼出的字母字符串
    */

    public void appendString(String digits,int index,List<String> listString,StringBuffer stringBuffer){
        if(index == digits.length()){//整个数字已经被完整遍历了一次
            listString.add(stringBuffer.toString());//将得到的字符串加入集合中
            return;
        }

        String s = stringOfNums(digits.charAt(index));//获得当前数字得到的字符组合

        for(int i = 0;i < s.length();i++){//遍历这个字符组合
            stringBuffer.append(s.charAt(i));//插入每个字符
            appendString(digits,index + 1,listString,stringBuffer);//继续向后遍历数字，插入字符
            stringBuffer.deleteCharAt(stringBuffer.length()-1);//回溯，将当前插入的删除，从而可以插入其他可能性的字符
        }
    }

    //返回每个数字所能代表的字符数组
    public String stringOfNums(char c){
        String s = "";    
        
        switch(c){
            case '2':
                s = "abc";
                break;
            case '3':
                s = "def";
                break;
            case '4':
                s = "ghi";
                break;
            case '5':
                s = "jkl";
                break;
            case '6':
                s = "mno";
                break;
            case '7':
                s = "pqrs";
                break;
            case '8':
                s = "tuv";
                break;
            case '9':
                s = "wxyz";
                break;
        }

        return s;
    }
}

 2.答案解法：利用一个哈希表来存储各种数字代表的字符数组，然后还是回溯的思想。

class Solution {
    public List<String> letterCombinations(String digits) {
        List<String> combinations = new ArrayList<String>();
        if (digits.length() == 0) {
            return combinations;
        }
        //哈希表存储数字对应的字符数组
        Map<Character, String> phoneMap = new HashMap<Character, String>() {{
            put('2', "abc");
            put('3', "def");
            put('4', "ghi");
            put('5', "jkl");
            put('6', "mno");
            put('7', "pqrs");
            put('8', "tuv");
            put('9', "wxyz");
        }};

        backtrack(combinations, phoneMap, digits, 0, new StringBuffer());
        return combinations;
    }

    /*
        combinations:存储结果的集合
        phoneMap:哈希表，存储数字对应的字符数组
        digits:数字字符串
        index:当前遍历到的下标
        combination:当前拼出的字符串
    */
    public void backtrack(List<String> combinations, Map<Character, String> phoneMap, String digits, int index, StringBuffer combination) {
        if (index == digits.length()) {//数字字符串遍历完
            combinations.add(combination.toString());
        } else {
            char digit = digits.charAt(index);//获得当前遍历到的数字
            String letters = phoneMap.get(digit);//获得数字对应的字符数组
            int lettersCount = letters.length();
            for (int i = 0; i < lettersCount; i++) {//遍历当前字符数组
                combination.append(letters.charAt(i));
                backtrack(combinations, phoneMap, digits, index + 1, combination);//继续向后寻找可能的字符
                combination.deleteCharAt(index);//回溯
            }
        }
    }
}

        这种方法需要哈希表的辅助空间。

3.其他解法：来自评论@awsl

class Solution {

    // 数字到号码的映射
    private String[] map = {"abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};

    // 路径
    private StringBuilder sb = new StringBuilder();

    // 结果集
    private List<String> res = new ArrayList<>();

    public List<String> letterCombinations(String digits) {
        if(digits == null || digits.length() == 0) return res;
        backtrack(digits,0);
        return res;
    }

    // 回溯函数
    private void backtrack(String digits,int index) {
        if(sb.length() == digits.length()) {
            res.add(sb.toString());
            return;
        }
        String val = map[digits.charAt(index)-'2'];//获得当前数字代表的字符串
        for(char ch:val.toCharArray()) {
            sb.append(ch);
            backtrack(digits,index+1);
            sb.deleteCharAt(sb.length()-1);
        }
    }
}

题源：力扣