学习目标:
216 组合总和
17 电话号码的字母组合
学习内容:
回溯算法
学习时间:
2022 12 5
学习产出:
216 组合总和
class Solution {
private:
vector<vector<int>> res;
vector<int> path;
void backtracking(int taretsum,int sum,int k,int startindex){
if(path.size()==k){
if(sum==taretsum){
res.push_back(path);
return;
}
}
for(int i = startindex;i<=9;i++){
sum+=i;
path.push_back(i);
backtracking(taretsum,sum,k,i+1);
sum-=i;
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum3(int k, int n) {
backtracking(n,0,k,1);
return res;
}
};
17 电话号码的字母组合
class Solution {
private:
const string lettermap[10]={
"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"
};
vector<string> res;
string s;
void backtracking(const string& digits,int index){
if(index==digits.size()){
res.push_back(s);
return;
}
int digit = digits[index]-'0';
string letters = lettermap[digit];
for(int i =0;i<letters.size();i++){
s.push_back(letters[i]);
backtracking(digits,index+1);
s.pop_back();
}
}
public:
vector<string> letterCombinations(string digits) {
if(digits=="") return res;
backtracking(digits,0);
return res;
}
};