文章目录
1.组合总和III
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
int sum;
void backtarcking(int k, int n, int startIndex) {
if(sum > n) return;//减枝
if(path.size() == k) {//终止条件
if(sum == n) result.push_back(path);
return;
}
for(int i = startIndex; i <= 9; i++) {
sum += i;
path.push_back(i);
backtarcking(k, n, i + 1);
sum -= i;
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum3(int k, int n) {
result.clear(); // 可以不加
path.clear(); // 可以不加
sum = 0;
backtarcking(k, n, 1);
return result;
}
};
2.电话号码的字母组合
class Solution {
private:
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 s;
void backtracking(const string& digits, int index) {
//终止条件
if(index == digits.size()) {
result.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.size() == 0) {
return result;
}
backtracking(digits, 0);
return result;
}
};