题目:
Given a collection of integers that might contain duplicates, nums, 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 nums = [1,2,2]
, a solution is:
[ [2], [1], [1,2,2], [2,2], [1,2], [] ]
<pre name="code" class="cpp">class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int> > res;
if (nums.empty()) return res;
vector<int> oneSubset;
sort(nums.begin(), nums.end());//排序
subsetsWithDupCore(nums, 0, oneSubset, res);
return res;
}
private:
void subsetsWithDupCore(vector<int>& nums, int start, vector<int>oneSubset, vector<vector<int> > &res){
res.push_back(oneSubset);//输出start之前的元素形成的子集
for (int i = start; i < nums.size(); ++i){//依次从start开始的元素中选一个元素放入子集,并递归求解该元素之后的元素组成的子集
if (i != start && nums[i] == nums[i - 1]) continue;
oneSubset.push_back(nums[i]);
subsetsWithDupCore(nums, i + 1, oneSubset, res);
oneSubset.pop_back();
}
}
};