目录
216 组合总和III
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void backtracking(int k, int n, int startIndex){
if(path.size() == k){
int sum = 0;
for(int i = 0; i < k; i++){
sum += path[i];
}
if(sum == n){
result.push_back(path);
}
return;
}
for(int i = startIndex; i <= 9; i++){
path.push_back(i);
backtracking(k, n, i + 1);
path.pop_back();
}
}
vector<vector<int>> combinationSum3(int k, int n) {
backtracking(k, n, 1);
return result;
}
};
17 电话号码的字母组合
class Solution {
public:
string mapstr[10] = {
"","","abc","def","ghi", "jkl", "mno", "pqrs", "tuv", "wxyz",
};
vector<string> result;
string s;
void backtracking(string digits, int index){
if(index == digits.size()){
result.push_back(s);
return;
}
int digit = digits[index] - '0';
string str = mapstr[digit];
for(int i = 0; i < str.size(); i++){
s.push_back(str[i]);
backtracking(digits, index + 1);
s.pop_back();
}
}
vector<string> letterCombinations(string digits) {
if(digits.size() == 0){
return result;
}
backtracking(digits, 0);
return result;
}
};