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], [] ]
这套题是在78题字数组的基础上滤除重复元素的字数组题,更一般化。可以直接借用78题的dfs思路,但是要把握好过滤掉重复元素的条件。看了网上的答案,借鉴一下40题的思路,先将数组进行排序(已想出),然后对重复的元素进行滤除(没想出)。递归的时候,因为是dfs,所以每次递归的时候开始的元素组成的子集总是能把后面左右重复的不重复的子元素包含住,因此在后面遇到相等的元素时,直接跳过相等的元素组成的子集即可。代码记录如下:
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int>> ret;
vector<int> tmp;
sort(nums.begin(), nums.end());
ret.push_back(tmp); //empty subsets
dfsSubsets(ret, tmp, nums, 0);
return ret;
}
void dfsSubsets(vector<vector<int>> &ret, vector<int> &tmp, const vector<int>& nums, int next)
{
if (next == nums.size())
return;
for (int i = next; i < nums.size(); i++)
{
if(i > next && nums[i] == nums[i - 1]) continue;
tmp.push_back(nums[i]);
ret.push_back(tmp); //Attension!
dfsSubsets(ret, tmp, nums, i + 1);
tmp.pop_back();
}
}
};