题目描述:
给定一个仅包含数字 2-9
的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例:
输入:"23" 输出:["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
代码如下:
class Solution {
public:
string Number[10] = { "","","abc","def"
,"ghi" ,"jkl" ,"mno"
,"pqrs" ,"tuv" ,"wxyz" };
vector<string>t;
string tt;
vector<string> letterCombinations(string digits) {
if (digits.length() == 0)
{
if(tt!="")
t.push_back(tt);
return t;
}
for (int i = 0; i < Number[digits[0] - '0'].length(); i++)
{
string ts = tt;
tt = tt + Number[digits[0]-'0'][i];
letterCombinations(digits.substr(1, digits.length() - 1));
tt = ts;
}
return t;
}
};