LeetCode 17. Letter Combinations of a Phone Number

最新推荐文章于 2022-11-19 15:55:23 发布

风雪夜不眠人

最新推荐文章于 2022-11-19 15:55:23 发布

阅读量220

点赞数 1

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/qq_33519317/article/details/94874909

版权

LeetCode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

int Len;
string digit_map[8]{ "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };
void search(const string& digits, int pos, string path, vector<string>& v)
{
	if (pos == Len) return;
	string s = digit_map[digits[pos] - '2'];
	for (int i = 0; s[i]; ++i)
	{
		if (pos == Len - 1) v.push_back(path + s[i]);
		else search(digits, pos + 1, path + s[i], v);
	}
}
vector<string> letterCombinations(string digits)
{
	Len = digits.length();
	vector<string> v;
	search(digits, 0, "", v);
	return v;
}

   //java
   class Solution {
    public List<String> letterCombinations(String digits) {
        if(digits.length()==0)
            return new ArrayList<String>();
        String [] str={" ","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        List<String> ans=new ArrayList<>();
        ans.add("");
        for(int i=0;i<digits.length();i++)
        {
            String letter=str[digits.charAt(i)-'0'];
            int size=ans.size();
            for(int j=0;j<size;j++)
            {
                String t=ans.get(0);
                ans.remove(0);
                for(int k=0;k<letter.length();k++)
                {
                    ans.add(t+letter.charAt(k));
                }
            }
        }
        return ans;
    }
}