● 216.组合总和III
递归回溯的算法,这道题和77.组合很像,就是多加了一个有关加和的判定条件,整体按照回溯算法的框架来就好。
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
vector<vector<int>> combinationSum3(int k, int n) {
backtracking(k,n,0,1);
return result;
}
void backtracking(int k,int target,int sum,int index)
{
if(sum>target)
return ;
if(path.size()==k)
{
if(target==sum)
{
result.push_back(path);
}
return;
}
for(int i=index;i<=9-(k-path.size())+1;i++)
{
sum+=i;
path.push_back(i);
backtracking(k,target,sum,i+1);
sum-=i;
path.pop_back();
}
}
};
● 17.电话号码的字母组合
这道题的回溯相对来说更加简单一点,不用考虑去掉特殊情况的问题,只要深度遍历回溯就好了。利用函数调用巧妙的隐藏回溯的过程。
class Solution {
public:
const string dial[10]={
"",
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
vector<string> result;
void backtracking(int index,string digits,string s)
{
if(index==digits.size())
{
result.push_back(s);
return ;
}
int digit=digits[index]-'0';
string tmp=dial[digit];
for(int i=0;i<tmp.size();i++)
{
backtracking(index+1,digits,s+tmp[i]);
}
}
vector<string> letterCombinations(string digits) {
if(digits.size()==0)
return result;
backtracking(0,digits,"");
return result;
}
};