给定一个仅包含数字 2-9
的字符串,返回所有它能表示的字母组合。答案可以按 任意顺序 返回。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例 1:
输入:digits = "23" 输出:["ad","ae","af","bd","be","bf","cd","ce","cf"]
示例 2:
输入:digits = "" 输出:[]
示例 3:
输入:digits = "2" 输出:["a","b","c"]
提示:
0 <= digits.length <= 4
digits[i]
是范围['2', '9']
的一个数字。
class Solution {
private:
const string table[10] = {
"",
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
string rec = "";
vector<string> res = {};
public:
void backtrack(const string& digits, int index){
if (index == digits.size())
{
res.push_back(rec);
return;
}
int digit = digits[index] - '0';
for (int i = 0; i < table[digit].size(); i++)
{
rec.push_back(table[digit][i]);
backtrack(digits, index+1);
rec.pop_back();
}
return;
}
vector<string> letterCombinations(string digits) {
if (digits.size() == 0) return {};
backtrack(digits, 0);
return res;
}
};
0 ms 100%
6.8 MB 50.97%