-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy pathsolution090.cpp
More file actions
56 lines (48 loc) · 1.06 KB
/
solution090.cpp
File metadata and controls
56 lines (48 loc) · 1.06 KB
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
45
46
47
48
49
50
51
52
53
54
55
56
/**
* Subsets II
*
* cpselvis([email protected])
* September 14th, 2016
*/
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
vector<vector<int> > subsetsWithDup(vector<int>& nums) {
vector<vector<int> > ret;
vector<int> sub;
sort(nums.begin(), nums.end());
backtack(nums, sub, ret, 0);
return ret;
}
void backtack(vector<int> &nums, vector<int> &sub, vector<vector<int> > &ret, int index)
{
if (find(ret.begin(), ret.end(), sub) == ret.end())
{
ret.push_back(sub);
}
for (int i = index; i < nums.size(); i ++)
{
sub.push_back(nums[i]);
backtack(nums, sub, ret, i + 1);
sub.pop_back();
}
}
};
int main(int argc, char **argv)
{
int arr[3] = {1, 2, 2};
vector<int> nums(arr + 0, arr + 3);
Solution s;
vector<vector<int> > ret = s.subsetsWithDup(nums);
for (int i = 0; i < ret.size(); i ++)
{
cout << "i=" << i<< endl;
for (int j = 0; j < ret[i].size(); j ++)
{
cout << ret[i][j] << endl;
}
cout << "end" << endl;
}
}