● 216.组合总和III
简简单单soeasy
class Solution {
private:
vector<vector<int>>res;
vector<int>path;
void backtracking(int k,int n,int start,int sum)
{
if(path.size()==k&&sum==n)
{
res.push_back(path);
return ;
}
for(int i=start;i<=9;i++)
{
path.push_back(i);
sum+=i;
backtracking(k,n,i+1,sum);
path.pop_back();
sum-=i;
}
}
public:
vector<vector<int>> combinationSum3(int k, int n)
{
res.clear();
path.clear();
backtracking(k,n,1,0);
return res;
}
};
● 17.电话号码的字母组合
class Solution {
private:
const string lettermap[10]={
"", // 0
"", // 1
"abc", // 2
"def", // 3
"ghi", // 4
"jkl", // 5
"mno", // 6
"pqrs", // 7
"tuv", // 8
"wxyz", // 9
};
public:
vector<string>result;
string s;
void backtrack(const string&digits,int index)
{
if(index==digits.size())
{result.push_back(s);
return;
}
int digit=digits[index]-'0';
string letters=lettermap[digit];
for(int i=0;i<letters.size();i++)
{
s.push_back(letters[i]);
backtrack(digits,index+1);
s.pop_back();
}
}
vector<string> letterCombinations(string digits)
{
s.clear();
result.clear();
if(digits.size()==0)
return result;
backtrack(digits,0);
return result;
}
};