Subsets II
Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
- Elements in a subset must be in non-descending order.
- The solution set must not contain duplicate subsets.
For example,
If S = [1,2,2]
, a solution is:
[ [2], [1], [1,2,2], [2,2], [1,2], [] ]
算法思想:
递归求解,按照答案要求先要排序
递归:
增量构造
class Solution {
public:
void dfs(vector<int> &S,int start,vector<int> &path,vector<vector<int>> &result){
result.push_back(path);
for(int i=start;i<S.size();i++){
if(i!=start&&S[i]==S[i-1])continue;
path.push_back(S[i]);
dfs(S,i+1,path,result);
path.pop_back();
}
}
vector<vector<int> > subsetsWithDup(vector<int> &S) {
vector<vector<int>> result;
vector<int> path;
sort(S.begin(),S.end());
dfs(S,0,path,result);
return result;
}
};
迭代:
增量构造法:
class Solution {
public:
vector<vector<int> > subsetsWithDup(vector<int> &S) {
sort(S.begin(),S.end());
vector<vector<int>> result(1);
size_t previous_size=0;
for(size_t i=0;i<S.size();++i){
const size_t size=result.size();
for(size_t j=0;j<size;++j){
if(i==0||S[i]!=S[i-1]||j>= previous_size){
result.push_back(result[j]);
result.back().push_back(S[i]);
}
}
previous_size=size;
}
return result;
}
};
二进制法:
class Solution {
public:
vector<vector<int> > subsetsWithDup(vector<int> &S) {
sort(S.begin(),S.end());
set<vector<int>> res;//set去重
vector<vector<int>> result;
const size_t n=S.size();
vector<int> v;
for(size_t i=0;i<1<<n;i++){
for(size_t j=0;j<n;j++){
if(i&1<<j)v.push_back(S[j]);
}
res.insert(v);
v.clear();
}
copy(res.begin(),res.end(),back_inserter(result));
return result;
}
};