代码随想录算法训练营第二十五天
一、216.组合总和|||
思路
该题相比77.组合相比无非是额外添加了一个限制,当组合的总和达到target时才添加进结果集,比较简单。
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void traversal(int k, int n, int startindex){
if(path.size() == k){
int sum = 0;
for(int i = 0; i < k; i++){
sum += path[i];
}
if(sum == n){
result.push_back(path);
return ;
}
else
return ;
}
for(int j = startindex; j <= 9 - (k - path.size()) + 1; j++){
path.push_back(j);
traversal(k, n, j+1);
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum3(int k, int n) {
result.clear();
path.clear();
traversal(k,n,1);
return result;
}
};
二、17.电话号码的字母组合
思路
- 定义一个二维数组保存数字对于字母
- string转换为int
- 用回溯法来解决数字数量对于的n个循环
class Solution {
private:
string path;
vector<string> result;
const vector<string> numbertozimu = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
void backtracking(string digits, int number){
if(path.size() == digits.size()){
result.push_back(path);
return ;
}
int digit = digits[number] - '0';
string letters = numbertozimu[digit -2];
for(int i = 0; i < letters.size(); i++){
path.push_back(letters[i]);
backtracking(digits, number+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;
}
};