17. 电话号码的字母组合 leetcode

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

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

 public List<String> letterCombinations(String digits) {
        String[] a = {" ", " ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        List<String> result = new ArrayList<>();
        if(digits.length()==0){
            return  result;
        }
        
        //replaceFirst ()
        Map<String,Integer> map1 = new HashMap<>();
        for (int i = 0; i <= 9 ; i++) {
            map1.put(String.valueOf(i),i);
        }
        String S ="";
        dfs(result,a,map1,digits,0,digits.length(),S);


        return result;
    }

    private void dfs(List<String> result,String[] a, Map<String,Integer> map,String digits, int cnt, int len, String path){
        if(cnt==len){
            result.add(path);
            return;
        }
        char act =digits.charAt(cnt);
        int le =map.get(String.valueOf(act));
        //System.out.println(le);
       int l = a[le].length();
        //System.out.println(l);
       for (int i = 0; i < l; i++) {
            path=path+a[le].charAt(i);
            dfs(result,a,map,digits, cnt+1,len,path );
            path = path.substring(0,path.length() - 1);
       }
    }