17-电话号码的字母组合

回溯法

class Solution {
    public List<String> letterCombinations(String digits) {
        //回溯法
        List<String> ans = new ArrayList<>();
        if(digits.length() == 0)
            return ans;
        String[] strs = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};//0-7
        backTrace(ans, strs, digits, 0, new StringBuilder());//有字符串拼接操作时，使用StringBuilder或StringBuffer会更快！
        return ans;
    }

    public void backTrace(List<String> ans, String[] strs, String digits, int index, StringBuilder sb){
        if(index == digits.length()){
            ans.add(sb.toString());
            return;
        }
        int t = digits.charAt(index) - '2';
        String str = strs[t];
        for(int i = 0;i < str.length();i++){
            sb.append(str.charAt(i));
            backTrace(ans, strs, digits, index+1, sb);
            sb.deleteCharAt(index);//删除末尾元素
        }
    }
}