文档讲解:代码随想录 (programmercarl.com)
视频讲解:代码随想录的个人空间-代码随想录个人主页-哔哩哔哩视频 (bilibili.com)
LeetCode 216.组合总和III
题目链接:216. 组合总和 III - 力扣(LeetCode)
代码如下:
class Solution {
public:
vector<vector<int>>res;
vector<int> path;
int sum=0;
void backtracking(int k,int n,int start){
if(path.size()==k&&sum==n)res.push_back(path);
for(int i=start;i<10;i++){
path.push_back(i);
sum+=i;
backtracking(k,n,i+1);
sum-=i;
path.pop_back();
}
}
vector<vector<int>> combinationSum3(int k, int n) {
backtracking(k,n,1);
return res;
}
};
LeetCode 17.电话号码的字母组合
题目链接:17. 电话号码的字母组合 - 力扣(LeetCode)
解题思路:建立字典,进行回溯。
解题代码如下:
class Solution {
public:
vector<string>res;
string s;
string map[8]={
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
void backtracking(const string &digits,int index){
if(index==digits.size()){
res.push_back(s);
return;
}
int digit=digits[index]-'2';
string letters=map[digit];
for(int i=0;i<letters.size();i++){
s.push_back(letters[i]);
backtracking(digits,index+1);
s.pop_back();
}
}
vector<string> letterCombinations(string digits) {
if(digits.size()==0)return res;
backtracking(digits,0);
return res;
}
};