216.组合总和III
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:和组合问题有啥区别?回溯算法如何剪枝?| LeetCode:216.组合总和III_哔哩哔哩_bilibili
状态:通过
代码实现:
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
int sum = 0;
void backTracking(int k, int n, int startNum){
if(sum == n && path.size() == k){
result.push_back(path);
return;
}
for(int i = startNum; i <= 9; i++){
path.push_back(i);
sum += i;
backTracking(k, n , i + 1);
path.pop_back();
sum -= i;
};
return;
}
public:
vector<vector<int>> combinationSum3(int k, int n) {
backTracking(k, n, 1);
return result;
}
};
17.电话号码的字母组合
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:还得用回溯算法!| LeetCode:17.电话号码的字母组合_哔哩哔哩_bilibili
状态:未通过
代码实现:
class Solution {
private:
vector<string> result;
string path;
const string letterMap[10] = {
"",
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
void backTracking(string digits, int Index){
if(Index == digits.size()){
result.push_back(path);
return;
}
int k = digits[Index] - '0';
string s = letterMap[k];
for(int i = 0; i < s.length(); i++){
path.push_back(s[i]);
backTracking(digits, Index + 1);
path.pop_back();
}
};
public:
vector<string> letterCombinations(string digits) {
path.clear();
result.clear();
if(digits.size() == 0){
return result;
}
backTracking(digits, 0);
return result;
}
};