电话号码的字母组合(第17题)

题目：

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。

给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

示例：

输入："23"
输出：["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

 说明:
尽管上面的答案是按字典序排列的，但是你可以任意选择答案输出的顺序。

代码：

class Solution {
    public Map<String, String> number() {
        Map<String, 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");
        return map;
    }
    public List<String> output = new ArrayList<>();

    public void transback(String str, String digit) {
        Map<String, String> numberMap = number();
        if (digit.length() == 0) {
            output.add(str);
        } else {
            String substring = digit.substring(0, 1);
            String substrings = numberMap.get(substring);
            for (int i = 0; i < substrings.length(); i++) {
                String substring1 = substrings.substring(i, i + 1);
                transback(str + substring1, digit.substring(1));
            }
        }
    }

    public List<String> letterCombinations(String digits) {
        if (digits.length() != 0)
            transback("", digits);
        return output;
    }
}

代码：

public static void main(String[] args) {
        ss s = new ss();
        List<String> list = s.letterCombinations("23");
        System.out.println(list);
    }

    public List<String> getList(int index) {
        List<String> ans = new ArrayList<>();
        String[] str = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        for (int i = 0; i < str[index].length(); i++) {
            ans.add(str[index].charAt(i) + "");
        }
        return ans;
    }

    public List<String> mul(List<String> list1, List<String> list2) {
        if (list1.size() == 0 && list2.size() != 0) {
            return list2;
        }
        if (list1.size() != 0 && list2.size() == 0) {
            return list1;
        }
        List<String> ans = new ArrayList<>();
        for (int i = 0; i < list1.size(); i++) {
            for (int j = 0; j < list2.size(); j++) {
                ans.add(list1.get(i) + list2.get(j));
            }
        }
        return ans;
    }

    public List<String> letterCombinations(String digits) {
        List<String> ans = new ArrayList<>();
        for (int i = 0; i < digits.length(); i++) {
            ans = mul(ans, getList(digits.charAt(i) - '0'));
        }
        return ans;
    }

代码：

public static void main(String[] args) {
        ss s = new ss();
        List<String> list = s.letterCombinations("23");
        System.out.println(list);
    }

    public List<String> letterCombinations(String digits) {
        LinkedList<String> ans = new LinkedList<>();
        if (digits.length() == 0) {
            return ans;
        }
        String[] str = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        ans.add("");
        for (int i = 0; i < digits.length(); i++) {
            int index = digits.charAt(i) - '0';

            while (ans.peek().length() == i) {
                String remove = ans.remove();
                for (char c : str[index].toCharArray()) {
                    ans.add(remove + c);
                }
            }
            
        }
        return ans;
    }

代码：

private String[] str = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};

    public List<String> letterCombinations(String digits) {
        List<String> list = new ArrayList<>();
        if (digits.length() == 0) {
            return list;
        }
        comb("", digits, 0, list);
        return list;
    }

    public void comb(String prefex, String digit, int offset, List<String> list) {
        if (offset == digit.length()) {
            list.add(prefex);
            return;
        }
        String s = str[digit.charAt(offset) - '0'];
        for (int i = 0; i < s.length(); i++) {
            comb(prefex + s.charAt(i), digit, offset + 1, list);
        }
    }