leetcode017 Letter Combinations of a Phone Number

最新推荐文章于 2020-10-13 06:37:16 发布

jnuyanfa

最新推荐文章于 2020-10-13 06:37:16 发布

阅读量294

点赞数

分类专栏：算法 LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/jnuyanfa/article/details/51020561

版权

算法同时被 3 个专栏收录

36 篇文章 0 订阅

订阅专栏

LeetCode

35 篇文章 0 订阅

订阅专栏

JAVA

35 篇文章 0 订阅

订阅专栏

题目

17. Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below.

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

思路：

利用递归求解。

代码：

private List<String> out = new ArrayList<>();

private List<String> in = new ArrayList<>();

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



public List<String> letterCombinations(String digits)

{

    if(digits == null || digits.length() == 0 || digits.contains("1") || digits.contains("0"))

        return out;

    char[] c_digits = digits.toCharArray();

    for(char c_digit : c_digits) in.add(resources[c_digit - '0']);

    getString("", 0);

    return out;

}



private void getString(String builder, int index)

{

    char[] chars = in.get(index).toCharArray();

    if(index == in.size() - 1)

        for(char c : chars)

            out.add(builder + c);

    else

        for(char aChar : chars)

            getString(builder + aChar, index + 1);

}