leetcode Java二刷：17. 电话号码的字母组合

题目：17. 电话号码的字母组合

思路：回溯。

代码：

class Solution {
    public List<String> letterCombinations(String digits) {
        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");

        String[] alpha = new String[digits.length()];
        List<String> res = new ArrayList<>();

        for (int i = 0; i < digits.length(); i++) {
            alpha[i] = map.get(digits.charAt(i));
        }
        backtrack(alpha, 0, "", res);
        return res;

    }
    public void backtrack(String[] alpha, int pos, String aim, List<String> res) {
        if (alpha == null || alpha.length == 0) {
            return;
        }
        if (pos == alpha.length) {
            res.add(aim);
            return;
        }
        for (int i = 0; i < alpha[pos].length(); i++) {
            aim += alpha[pos].charAt(i);
            backtrack(alpha, pos + 1, aim, res);
            aim = aim.substring(0, aim.length() - 1);
        }

    }
}