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