-
Notifications
You must be signed in to change notification settings - Fork 0
/
Subsets2.cpp
44 lines (36 loc) · 1.21 KB
/
Subsets2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
// Subsets II
// Given an integer array nums that may contain duplicates, return all possible subsets (the power set).
// The solution set must not contain duplicate subsets. Return the solution in any order.
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int>> res;
vector<int> empty;
res.push_back(empty);
if(nums.size()==0){
return res;
}
int last_size=0;
sort(nums.begin(), nums.end());
for(int i=0;i<nums.size();i++){
if(i==0 || nums[i]!=nums[i-1]){
last_size = res.size();
for(int j=0;j<last_size;j++){
vector<int> temp = res[j];
temp.push_back(nums[i]);
res.push_back(temp);
}
}
else{
int j=last_size;
last_size = res.size();
for( j=j ;j<last_size;j++){
vector<int> temp = res[j];
temp.push_back(nums[i]);
res.push_back(temp);
}
}
}
return res;
}
};