1.题目
17. 电话号码的字母组合 - 力扣(LeetCode)
https://leetcode.cn/problems/letter-combinations-of-a-phone-number/description/
![](https://img-blog.csdnimg.cn/direct/7448a536edf24755a8e49de4799f3f3c.png)
2.思路
![](https://img-blog.csdnimg.cn/direct/c7e9cfe15e7d4976a2b18e1938964cfa.png)
3.代码
class Solution
{
string hash[10]={" "," ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
vector<string> ret;
string path;
public:
vector<string> letterCombinations(string digits)
{
if(digits.size()==0)
return ret;
dfs(digits,0);
return ret;
}
void dfs(string& digits,int pos)
{
if(pos==digits.size())
{
ret.push_back(path);
return;
}
for(auto e:hash[digits[pos]-'0'])
{
path.push_back(e);
dfs(digits,pos+1);
path.pop_back();
}
}
};