class Solution {
public:
vector<string> letterCombinations(string digits) {
vector<string> ans;
if(digits==""){
return ans;
}
string combination="";
dfs(ans,combination,digits);
return ans;
}
void dfs(vector<string> &ans,string combination,string digits){
if(digits==""){
ans.push_back(combination);
return;
}
string button=buttons[digits[0]-'0'];
digits.erase(digits.begin());
for(auto c:button){
dfs(ans,combination+c,digits);
}
}
private:
const string buttons[10]={" ","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
};
17 Letter Combinations of a Phone Number
最新推荐文章于 2020-06-18 21:15:29 发布