216.组合总和III
关于回溯算法我们要记住的重要一点:别忘了处理过程 和 回溯过程是一一对应的,处理有加,回溯就要有减,处理有push,回溯就要有pop!!
class Solution {
private:
vector<int> vec;
vector<vector<int>> result;
void backtracking(int n,int k,int sum,int startindex){
if(vec.size() == k){
if(sum == n){
result.push_back(vec);
return;
}
}
for (int i = startindex; i <= 9; i++){
sum = sum + i;
vec.push_back(i);
backtracking(n,k,sum,i+1);
sum = sum - i;
vec.pop_back();
}
}
public:
vector<vector<int>> combinationSum3(int k, int n) {
backtracking(n,k,0,1);
return result;
}
};
17.电话号码的字母组合
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
};
public:
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'; // 将index指向的数字转为int
string letters = letterMap[digit]; // 取数字对应的字符集
for (int i = 0; i < letters.size(); i++) {
s.push_back(letters[i]); // 处理
backtracking(digits, index + 1); // 递归,注意index+1,一下层要处理下一个数字了
s.pop_back(); // 回溯
}
}
vector<string> letterCombinations(string digits) {
s.clear();
result.clear();
if (digits.size() == 0) {
return result;
}
backtracking(digits, 0);
return result;
}
};