【Leetcode】17. 电话号码的字母组合（Letter Combinations of a Phone Number）

最新推荐文章于 2020-08-26 19:22:42 发布

str_818

最新推荐文章于 2020-08-26 19:22:42 发布

阅读量177

点赞数 1

分类专栏： ----------算法日常---------- LeetCode 字符串精选Top面试题回溯文章标签： Leetcode 字符串回溯

本文链接：https://blog.csdn.net/qq_27124771/article/details/90762516

版权

----------算法日常---------- 同时被 3 个专栏收录

164 篇文章 3 订阅

订阅专栏

LeetCode

115 篇文章 3 订阅

订阅专栏

精选Top面试题

24 篇文章 0 订阅

订阅专栏

Leetcode - 17 Letter Combinations of a Phone Number (Medium)

Input: "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

Map<String, String> map = 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<>();
public List<String> letterCombinations(String digits) {
    if (digits.length() != 0) {
        helper(digits, "");
    }
    return res;
}
public void helper(String digits, String s) {
    if (s.length() == digits.length()) {
        res.add(s);
    } else {
        String tmp = map.get(digits.charAt(s.length()) + "");
        for (char c : tmp.toCharArray()) {
            helper(digits, s + c);
        }
    }
}