1 Star 0 Fork 0

xiangxiang/LeetCode-NOTES

Create your Gitee Account
Explore and code with more than 13.5 million developers,Free private repositories !:)
Sign up
文件
Clone or Download
solution.cpp 687 Bytes
Copy Edit Raw Blame History
默然 authored 7 years ago . update all algorithms.
class Solution
{
public:
vector<vector<int> > v;
vector<vector<int> > subsetsWithDup(vector<int> &S)
{
sort(S.begin(),S.end());
generate(vector<int>(), S, 0);
return v;
}
void generate(vector<int> res, vector<int> &S, int i)
{
if(i == S.size())
{
for(int i = 0; i < v.size(); i++)
{
if(v[i] == res)
{
return;
}
}
v.push_back(res);
return;
}
else
{
generate(res, S, i+1);
res.push_back(S[i]);
generate(res, S, i+1);
}
}
};
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/xiangxiang920/LeetCode-NOTES.git
git@gitee.com:xiangxiang920/LeetCode-NOTES.git
xiangxiang920
LeetCode-NOTES
LeetCode-NOTES
master

Search