class Solution {
public:
vector<string> mymap{"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
vector<string> result;
string s;
void backtracing(string &digits,int index)
{
if(index==digits.size())
{
result.push_back(s);
return;
}
int digit = digits[index]-'0';
string letter = mymap[digit];
for(int i=0;i<letter.size();i++)
{
s.push_back(letter[i]);
backtracing(digits,index+1);
s.pop_back();
}
}
vector<string> letterCombinations(string digits) {
s.clear();
result.clear();
if(digits.size()==0) return result;
backtracing(digits,0);
return result;
}
};
leetcode每日一题第164天
最新推荐文章于 2024-09-07 10:12:58 发布