解法一:non-recursion
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int>> res;
sort(nums.begin(), nums.end());
res.push_back({});
for(int i=0;i<nums.size();){
int s = res.size();
do{
for(int j=0;j<s;j++){
res.push_back(res[j]);
res[j].push_back(nums[i]);
}
i++;
}while(i<nums.size() && nums[i-1]==nums[i]);
}
return res;
}
};
只需在已经有此元素的组合里添加重复元素就行了。
解法二: recursion
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int>> res;
vector<int> out;
sort(nums.begin(), nums.end());
helper(nums, 0, out, res);
return res;
}
void helper(vector<int>& nums, int pos, vector<int>& out, vector<vector<int>>& res){
res.push_back(out);
for(int i=pos;i<nums.size();i++){
if(i!=pos && nums[i]==nums[i-1]) continue;
out.push_back(nums[i]);
helper(nums, i+1, out, res);
out.pop_back();
}
}
};
只要重复元素1号和只要重复元素2号是同一种情况,除非两个重复元素都要。