Description
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],
[]
]
Solution 1(C++)
class Solution {
public:
std::vector<std::vector<int> > subsetsWithDup(std::vector<int> &nums) {
std::sort(nums.begin(), nums.end());
std::vector<std::vector<int> > res;
std::vector<int> vec;
subsetsWithDup(res, nums, vec, 0);
return res;
}
private:
void subsetsWithDup(std::vector<std::vector<int> > &res, std::vector<int> &nums, std::vector<int> &vec, int begin) {
res.push_back(vec);
for (int i = begin; i != nums.size(); ++i){
if (i == begin || nums[i] != nums[i - 1]) {
vec.push_back(nums[i]);
subsetsWithDup(res, nums, vec, i + 1);
vec.pop_back();
}
}
}
};
Solution 2(C++)
class Solution {
public:
vector<vector<int> > subsetsWithDup(vector<int> &S) {
sort(S.begin(), S.end());
vector<vector<int>> ret = {{}};
int size = 0, startIndex = 0;
for (int i = 0; i < S.size(); i++) {
startIndex = i >= 1 && S[i] == S[i - 1] ? size : 0;
size = ret.size();
for (int j = startIndex; j < size; j++) {
vector<int> temp = ret[j];
temp.push_back(S[i]);
ret.push_back(temp);
}
}
return ret;
}
};
算法分析
这道题还是很有意思的,可以参考:LeetCode-78. Subsets。
核心思路就是,每一次添加新元素的时候,要注意如果这个新元素出现过,那么之前添加过的就不要在添加了。比如[1,2,2],第一个2添加过后,一共有4个子集:[]、[1]、[2]、[1,2],[2],[1,2]是由[],[1]添加元素2产生的。那么第二个元素2加入时,前两个元素就应该直接跳过,因为第一个元素2已经添加过一次了,然后,直接对[2]、[1,2]添加就可以了,[2,2]、[1,2,2]即可。
程序分析
略。