第七章 回溯算法part02

17.电话号码字母组合
 

class Solution {
    List<String> result = new ArrayList<>();
    

    public List<String> letterCombinations(String digits) {
        if(digits == null || digits.length() == 0){
            return result;
        }
        String numString[] = {"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        backtracking(digits,numString,0);
        return result;
    }
    StringBuilder s = new StringBuilder();
    public void backtracking(String digits,String[] numString,int index){
        if(index == digits.length()){
            result.add(s.toString());
            return;
        }
        String str = numString[digits.charAt(index)-'0'];
        for(int i = 0; i < str.length() ; i++){
            s.append(str.charAt(i));
            backtracking(digits,numString,index+1);
            s.deleteCharAt(s.length()-1);

        }
    }
}