216.组合总和III
题目:力扣
class Solution {
public:
vector<vector<int>> result;
vector<int> v;
void backtracking(int k,int n, int start,int sum){
if(sum > n) return;
if(v.size() == k){
if(sum == n){
result.push_back(v);
}
return;
}
for(int i = start; i <= 9; i++){
v.push_back(i);
sum += i;
backtracking(k,n,i+1,sum);
sum -= i;
v.pop_back();
}
}
vector<vector<int>> combinationSum3(int k, int n) {
backtracking(k,n,1,0);
return result;
}
};
17.电话号码的字母组合
题目:力扣
class Solution {
public:
const string letterMap[10] = {
"", // 0
"", // 1
"abc", // 2
"def", // 3
"ghi", // 4
"jkl", // 5
"mno", // 6
"pqrs", // 7
"tuv", // 8
"wxyz", // 9
};
vector<string> result;
string ans;
void backtracking(string digits,int start){
if(ans.size() == digits.size()){
result.push_back(ans);
}
for(int i = start; i < digits.size(); ++i){
int x = int(digits[i]) - 48;
for(int j = 0; j < letterMap[x].size(); ++j){
ans.push_back(letterMap[x][j]);
backtracking(digits,i+1);
ans.pop_back();
}
}
}
vector<string> letterCombinations(string digits) {
if(digits.size() == 0) return result;
backtracking(digits,0);
return result;
}
};
总结
题型:组合问题