每日算法：回溯

原题
17. 电话号码的字母组合
给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。

class Solution {
    public List<String> letterCombinations(String digits) {
        List<String> list = new ArrayList<>();
        if (digits == null || digits.length() == 0) {
            return list;
        }
        Map<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");
        backTrack(list, digits, map, 0, new StringBuilder());
        return list;
    }

    private void backTrack(List<String> list, String digits, Map<Character, String> map, int index, StringBuilder sb) {

        // recursion teminator
        if (sb.length() == digits.length()) {
            list.add(sb.toString());
            return;
        }

        // process current logic
        String value = map.get(digits.charAt(index));
        for (int j = 0; j < value.length(); j++) {

            // drill down
            backTrack(list, digits, map, index + 1, sb.append(value.charAt(j)));

            // reverse states
            sb.deleteCharAt(sb.length() - 1);
        }
    }
}

不用stringBuilder就不用删掉

class Solution {
	String[] letter_map = {" ","*","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
    List<String> res = new ArrayList<>();
	public List<String> letterCombinations(String digits) {
		if(digits==null || digits.length()==0) {
			return new ArrayList<>();
		}
		iterStr(digits, "", 0);
		return res;
	}
	void iterStr(String str, String letter, int index) {
		if(index==str.length()){
            res.add(letter);
            return;
        }
        String temp=letter_map[str.charAt(index)-'0'];
        for(int i=0;i<temp.length();i++){
            iterStr(str,letter+temp.charAt(i),index+1);
        }
	}
}