1.17. 电话号码的字母组合 - 力扣(LeetCode)
2.这个题可以用回溯来写哦
class Solution {
public:
string good2[10]={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
vector<string>strv;
string path;
void good(string digits,int dipth)
{
if(dipth>=digits.size())
{
strv.push_back(path);
return ;
}
for(auto ch:good2[digits[dipth]-'0'])
{
path.push_back(ch);
good(digits,dipth+1);
path.pop_back();
}
}
vector<string> letterCombinations(string digits) {
if(digits.size()==0)
{
return strv;
}
good(digits,0);
return strv;
}
};