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