leetcode#17. Letter Combinations of a Phone Number（dfs最优解）

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.

拿到题本来想用循环添加但是无论如何都需要三个for
因此在网上找到了这个最优解
思路为 hashmap+dfs
首先建立一个hashmap并确定数字对应的值
利用dfs得递归 一一得出字符串
个人觉得是非常巧妙的算法如果自己写很难写出来现在已经慢慢理解了dfs算法的核心思想
就好像一个解题套路 基本都是 递归+停止条件+删除最后一位

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.

class Solution {
    private Map<Character, char[]> getLettersMap() {
        //把数字对应的字母存入一个hashmap
        Map<Character, char[]> lettersMap = new HashMap<>();
        lettersMap.put('0', new char[]{});
        lettersMap.put('1', new char[]{});                
        lettersMap.put('2', new char[]{'a', 'b', 'c'});                
        lettersMap.put('3', new char[]{'d', 'e', 'f'});                
        lettersMap.put('4', new char[]{'g', 'h', 'i'});    
        lettersMap.put('5', new char[]{'j', 'k', 'l'});    
        lettersMap.put('6', new char[]{'m', 'n', 'o'});    
        lettersMap.put('7', new char[]{'p', 'q', 'r', 's'});    
        lettersMap.put('8', new char[]{'t', 'u', 'v'});    
        lettersMap.put('9', new char[]{'w', 'x', 'y', 'z'});    
        
        return lettersMap;
    }

    
    public List<String> letterCombinations(String digits) {
        
        List<String> res = new ArrayList<>(); 
        //创建一个list储存 结果
        
        
        if(digits.length()<1 ){//如果为空
            return res;
        }
        
        StringBuilder sb =new StringBuilder();
        //创建一个stringbuilder来储存每一个合成的字符
        
      Map<Character, char[]> lettersMap = getLettersMap(); 
        //把hahmap赋值，方便引用
        
        helper(digits,sb,lettersMap,res);
        //调用DFS(深度优先算法)
        
        return res;
    }
    
    
    
    public void helper(String digits,StringBuilder sb, Map<Character,char[]> lettersMap, List<String> res){
        
        if(sb.length() == digits.length()){
            //结束条件：sb得长度和数字长度一质，输出这个string到list中
            res.add(sb.toString());
            return;
        }
        
        for(char ch:lettersMap.get(digits.charAt(sb.length()))){//循环添加
            sb.append(ch);
            helper(digits,sb,lettersMap,res);
            sb.deleteCharAt(sb.length()-1);//添加完成后删除最后一个char组建下一个数
        }
    }
}