leetcode 17. Letter Combinations of a Phone Number

题目
全排列，其实就是用个深度优先搜索就行，dfs。

class Solution {
    public List<String> letterCombinations(String digits) {
        HashMap<Character,String> map = new HashMap<>();
        map.put('2',"abc");
        map.put('3',"def");
        map.put('4',"ghi");
        map.put('5',"jkl");
        map.put('6',"mno");
        map.put('7',"pqrs");
        map.put('8',"tuv");
        map.put('9',"wxyz");
        String[] str = new String[digits.length()];
        char[] arr = digits.toCharArray();
        if(arr.length==0) return new ArrayList<>();
        for(int i=0;i<arr.length;i++){
            str[i] = map.get(arr[i]);
        }
        List<String> list = new ArrayList<>();
        dfs(0,arr.length,str,list,"");
        return list;
    }
    public static void dfs(int index,int len,String[] str,List<String> list,String s){
        if(index==len){
            list.add(s);
            return;
        }
        String tmp = str[index];
        for(int i=0;i<tmp.length();i++){
            dfs(index+1,len,str,list,s+tmp.charAt(i));
        }
    }
}