给定一个仅包含数字 2-9
的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例:
输入:"23" 输出:["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
说明:
尽管上面的答案是按字典序排列的,但是你可以任意选择答案输出的顺序。
思路
- dfs+形参(结果、临时值)
code
class Solution {
public:
string str[10]={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
void helper(string &digits,vector<string> &v,int s,string &ss){
if(s==digits.size()){
v.push_back(ss);
return;
}
for(auto ch:str[digits[s]-'0']){
ss=ss+ch;
helper(digits,v,s+1,ss);
ss.pop_back();
}
}
vector<string> letterCombinations(string digits) {
if(digits.size()==0)
return {};
vector<string> v;
string ss="";
helper(digits,v,0,ss);
return v;
}
};