1 组合总和Ⅲ
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
void backtracking(int k, int n,int begin,int sum){
if(sum > n) return;//剪枝:如果已经大于目标值直接return
if( path.size()== k){ //终止条件必须是个数到了,就退出
if(sum == n ) result.push_back(path);
return;
}
for(int i = begin; i <= 9-(k-path.size())+1;i++){
path.push_back(i);
sum += i;
backtracking(k,n,i+1,sum);
path.pop_back();
sum -= i;
}
}
public:
vector<vector<int>> combinationSum3(int k, int n) {
int sum = 0;
backtracking(k,n,1,sum);
return result;
}
};
终止条件很重要,终止条件必须是个数到了就退出,不然会一直循环
2 电话号码的字母组合
要将数字和字母进行映射,可以用数组也可以用map
class Solution {
//多个集合进行组合不需要startindex进行去重
//映射
public:
string letterstring[10] = {" "," ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
string path;
vector<string> result;
void backtracking(const string& digits,int index){ //index:输入的数字个数索引
//终止条件
if(index == digits.size()){ //因为到最后一位还要进行处理,所以到最后一位的后一位终止
result.push_back(path);
return;
}
//将stirng转换为int
int letter = digits[index]-'0';
string letterS = letterstring[letter];
//宽
for(int i = 0; i<letterS.size();i++){
path.push_back(letterS[i]);
backtracking(digits,index+1);
path.pop_back();
}
}
public:
vector<string> letterCombinations(string digits) {
if(digits.size() == 0) return result;
backtracking(digits,0);
return result;
}
};