给定一个仅包含数字 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'] 的一个数字。
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/letter-combinations-of-a-phone-number
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
回溯思路模板:
c++代码:
class Solution {
private:
string path;
vector<string> res;
const string letterMap[10]={
"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"
};
void backtracking(const string& digits,int startIndex){
if(startIndex==digits.size()){
res.push_back(path);return;
}
int digit=digits[startIndex]-'0';
string letterString=letterMap[digit];
for(int i=0;i<letterString.size();i++)
{
path.push_back(letterString[i]);
backtracking(digits,startIndex+1);
path.pop_back();
}
}
public:
vector<string> letterCombinations(string digits) {
if(digits.size() == 0){
return res;
}
res.clear();path.clear();
backtracking(digits,0);
return res;
}
};
参照视频:
带你学透回溯算法-组合总和(对应「leetcode」力扣题目:39.组合总和)| 回溯法精讲!_哔哩哔哩_bilibili