LeetCode刷题笔记 17. 电话号码的字母组合

题目描述

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。
给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

示例:
输入：“23”
输出：[“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].

总结

类似排列组合的东西用回溯

Sample & Demo Code

class Solution {
    private String[] s = new String[]{"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;
        helper(0, digits, list, "");
        return list;
    }
    
    private void helper(int start, String digits, List<String> list, String sd) {
        if(start >= digits.length()) {
            list.add(sd);
            return; 
        }
        for(int i = 0; i < s[digits.charAt(start) - '2'].length(); i++) {
            helper(start+1, digits, list, sd + s[digits.charAt(start) - '2'].charAt(i));
        }
    }
}

Sample & Demo Code

class Solution {
    Map<String, String> phone = new HashMap<String, String>() {{
        put("2", "abc");
        put("3", "def");
        put("4", "ghi");
        put("5", "jkl");
        put("6", "mno");
        put("7", "pqrs");
        put("8", "tuv");
        put("9", "wxyz");
    }};
    List<String> res = new ArrayList<String>();

    public List<String> letterCombinations(String digits) {
        if(digits.length() != 0)
            backtrack("", digits);
        return res;
    }
    
    private void backtrack(String combination, String next_digits) {
        if(next_digits.length() == 0) { 
            res.add(combination);
        }else {
            String digit = next_digits.substring(0, 1);
            String letters = phone.get(digit);
            for(int i = 0; i < letters.length(); i++) {
                String letter = letters.substring(i, i+1);
                backtrack(combination + letter, next_digits.substring(1));
            }
        }
    }
}

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number