17. 电话号码的字母组合 java + 递归 解法

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

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

示例:

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

class Solution {
    public List<String> letterCombinations(String digits) {
        List<String> res = new ArrayList<>();
        if(digits.length()==0){
            return res;
        }
        String[] dict = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        lc_Dfs(digits,dict,0,"",res);
        return res;
    }
    public void lc_Dfs(String digits,String[] dict,int level,String out,List<String> res){
        if(level==digits.length()){
            res.add(out); 
        }else{
            String str = dict[digits.charAt(level)-'2'].toString();
            for(int i=0;i<str.length();i++){
                out = out + str.charAt(i);
                lc_Dfs(digits,dict,level+1,out,res);
                out = out.substring(0,out.length()-1);
                System.out.print(level);
            }
        }
    }
}