LeetCode216.组合总和|||
题目链接:216. 组合总和 III - 力扣(LeetCode)
思路:
class Solution {
public:
int sum = 0,start = 1;
vector<int> path;
vector<vector<int>> result;
void backtring(int k,int n,int sum,int start) {
if(path.size() == k) {
if(sum == n) {
result.push_back(path);
return ;
}
}
for(int i = start;i <= 9 - (k - path.size()) + 1 && sum <= n;i++) {//剪枝
path.push_back(i);
sum += i;
backtring(k,n,sum,i + 1);
sum -= i;//回溯
path.pop_back();
}
return ;
}
vector<vector<int>> combinationSum3(int k, int n) {
backtring(k,n,sum,start);
return result;
}
};
LeetCode17.电话号码的字母组合
题目链接:17. 电话号码的字母组合 - 力扣(LeetCode)
思路:
class Solution {
public:
string s;
//讲数字和字母做一个映射
string m[10] = {"",
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"};
vector<string> result;
void backtracking(string digits,int index) {
if(index == digits.size()) {
result.push_back(s);
return ;
}
int digit = digits[index] - '0';//index指向数字转换为int类型
string letter = m[digit];//取数字对应字符表
for(int i = 0;i < letter.size();i++) {
s.push_back(letter[i]);//处理
backtracking(digits,index + 1);//递归,注意index+1后已经开始处理下一个元素了
s.pop_back();//回溯
}
return ;
}
vector<string> letterCombinations(string digits) {
if(digits.size() == 0) return result;
backtracking(digits,0);
return result;
}
};