216. 组合总和 III
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void backtracing(int start, int n, int k, int sum) {
if (k == 0 && sum == n) {
result.push_back(path);
return;
}
for (int i = start; i <= 9; ++i) {
path.push_back(i);
k--;
sum += i;
backtracing(i + 1, n, k, sum);
path.pop_back();
k++;
sum -= i;
}
}
vector<vector<int>> combinationSum3(int k, int n) {
result.clear();
path.clear();
backtracing(1, n, k, 0);
return result;
}
};
17. 电话号码的字母组合
class Solution {
private:
const string letterMap[10] = {
"",
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
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';
string letters = letterMap[digit];
for (int i = 0; i < letters.size(); i++) {
s.push_back(letters[i]);
backtracking(digits, 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;
}
};