Leetcode letter combination of a phone number

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

proudmore

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

阅读量173

点赞数

分类专栏： leetcode-dfs leetcode leetcode backtracking

本文链接：https://blog.csdn.net/proudmore/article/details/46421987

版权

leetcode 同时被 3 个专栏收录

146 篇文章 0 订阅

订阅专栏

leetcode-dfs

9 篇文章 0 订阅

订阅专栏

leetcode backtracking

5 篇文章 0 订阅

订阅专栏

public class Solution {
    public List<String> letterCombinations(String digits) {
        list=new ArrayList<String>();
        if(digits.length()==0)return list;
        StringBuffer path=new StringBuffer();
        map=new HashMap<Character, String>();
        init();
        helper(digits,0,path);
        return list;
    }
    HashMap<Character, String> map;
    List<String> list;

    void init()
    {
        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");
    }
    void helper(String digits, int index, StringBuffer path)
    {
        if(index==digits.length())
        {
            list.add(path.toString());
        }
        else
        {
            char c=digits.charAt(index);
            if(c=='0'||c=='1')return;
            String match=map.get(c);
            for(int i=0;i<match.length();i++)
            {
                path.append(match.charAt(i));
                helper(digits,index+1,path);
                path.deleteCharAt(path.length()-1);
            }
        }
    }
}