216组合综合Ⅲ
class Solution {
public:
vector<vector<int>>res;
int sum=0;
vector<int>path;
vector<vector<int>> combinationSum3(int k, int n)
{
dg(k,n,1);
return res;
}
void dg(int k,int n,int start)
{
if(path.size()==k)
{
if(sum==n)res.push_back(path);
return;
}
for(int i=start;i<=9;i++)
{
sum+=i;
path.push_back(i);
dg(k,n,i+1);
path.pop_back();
sum-=i;
}
}
};
17电话号码的组合
class Solution {
public:
vector<string>res;
string temp;
vector<string>dh={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
vector<string> letterCombinations(string digits)
{
if (digits.size() == 0)
{
return res;
}
dg(digits,0);
return res;
}
void dg(string digits,int index)
{
if(temp.size()==digits.size())
{
res.push_back(temp);
return;
}
int n=digits[index]-'0';
string l=dh[n];
for(int j=0;j<l.size();j++)
{
temp.push_back(l[j]);
dg(digits,index+1);
temp.pop_back();
}
}
};