每日任务:dfs.LeetCode.17. 电话号码的字母组合

解题思路

需要注意的地方是按键顺序与字符串的产生顺序是有关的 比如说按了23
是不可能出现da的情况的 因为先按的2
既然这样也不用做标记，直接组合即可

代码

class Solution {
    private String[][] str = {{"a","b","c"},{"d","e","f"},{"g","h","i"},{"j","k","l"}
    ,{"m","n","o"},{"p","q","r","s"},{"t","u","v"},{"w","x","y","z"}};
    List<String> ans;
    public List<String> letterCombinations(String digits) {
        char[] digit = digits.toCharArray();
        ans = new ArrayList<>();
        if (digits.length()==0) return ans;
        List<String[]> chars = new ArrayList<>();
        for (int i=0;i<digit.length;i++){
            String[] str1= str[Integer.parseInt(String.valueOf(digit[i]))-2];
            chars.add(str1);
        }
        HashSet<String> check = new HashSet<>();//判断是否已经存在
        backTrack(digit.length,check,"",chars,0);
        return ans;
    }
    public void backTrack(int length, HashSet<String> check,String goal,List<String[]> chars,int rows){
        if (check.contains(goal)) return;
        if (goal.length()==length){
            ans.add(goal);
            check.add(goal);
            return;
        }
        int n = chars.size();
        String[] strings = chars.get(rows);
        for (int j=0;j<strings.length;j++){
            backTrack(length, check, goal+strings[j], chars,rows+1);
        }

    }
}