LeetCode 第17题：Letter Combinations of a Phone Number

范培华

于 2017-10-30 16:29:51 发布

阅读量595

点赞数

分类专栏：算法与数据结构文章标签：递归 leetcode string

本文链接：https://blog.csdn.net/fanpeihua123/article/details/78394389

版权

算法与数据结构专栏收录该内容

7 篇文章 1 订阅

订阅专栏

采用递归的思想。回溯法进行的暴力解法：

class Solution {
    public List<String> letterCombinations(String digits) {

        String[] table = new String[]{"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        List<String> list = new ArrayList<String>();
        letterCombinations(list,digits,"",0,table);

        return list;
    }

    private void letterCombinations(List<String> list,String digits,String current
                                    ,int index,String[] table){
        if(index == digits.length()){
            if(current.length() != 0){
                list.add(current);
            }
            return;
        }

        String temp = table[digits.charAt(index)-'0'];
        for(int i=0 ; i< temp.length(); i++){
            String next = current + temp.charAt(i);
            letterCombinations(list,digits,next,index+1,table);
        }
    }
}