/*
c(n,k)=c(n-1,k-1)+c(n-1,k)
*/
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<vector<int>> result;
if(k==n||k==0)
{
vector<int> temp;
for(int i=1;i<=k;i++)
{
temp.push_back(i);
}
result.push_back(temp);
return result;
}
else
{
vector<vector<int>> result2=combine(n-1,k);
vector<vector<int>> result1=combine(n-1,k-1);
for(int i=0;i<result1.size();i++)
{
result1[i].push_back(n);
result2.push_back(result1[i]);
}
return result2;
}
}
};
77. Combinations
最新推荐文章于 2020-09-27 14:28:42 发布