数组的子集Subsets 不能重复

最新推荐文章于 2021-09-21 14:47:25 发布

江上渔者21号

最新推荐文章于 2021-09-21 14:47:25 发布

阅读量220

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u010325193/article/details/80410257

版权

leetcode 专栏收录该内容

175 篇文章 3 订阅

订阅专栏

Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: [1,2,2]
Output:
[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

class Solution {

public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<int> ivec;
set<vector<int> > z;
vector<vector<int> > res;
sort(nums.begin(),nums.end()); // 排序是为了去重复
genesub(nums,0,ivec,z);

set<vector<int> >::iterator iter;
for(iter=z.begin();iter!=z.end();++iter){
res.push_back(*iter);
}
return res;
}

void genesub(vector<int> &nums,int k,vector<int> temp,set<vector<int> > &res){
res.insert(temp);

for(int i=k;i<nums.size();++i){
temp.push_back(nums[i]);
genesub(nums,i+1,temp,res);
temp.pop_back();
}
}
};