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