-
Notifications
You must be signed in to change notification settings - Fork 0
/
SubSetsII.cpp
63 lines (52 loc) · 1.45 KB
/
SubSetsII.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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
//
// SubSetsII.cpp
//
//
// Created by 廷芳 杜 on 7/10/13.
// Copyright (c) 2013 __MyCompanyName__. All rights reserved.
//
#include <iostream>
class Solution {
public:
vector< vector<int> > pool;
void findAllSubsets( vector<int> &S, vector<int> &subset, int id )
{
if( id == S.size() )
{
pool.push_back( subset );
return;
}
//create a vector to store duplicate
vector< int > dup;
for( int i = id; i < S.size(); i++ )
{
if( S[i] == S[id])
{
dup.push_back( S[i] );
}
else
break;
}
for( int i = 1; i <= dup.size(); i++ )
{
for( int j = 0; j < i; j++ )
subset.push_back( dup[0] );
findAllSubsets( S, subset, id+dup.size() );
for( int k = 0 ; k < i ; k++ )
subset.pop_back();
}
findAllSubsets( S, subset, id+dup.size() );
return;
}
vector<vector<int> > subsetsWithDup(vector<int> &S) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
pool.clear();
if( S.size()==0 ) return pool;
int id = 0;
vector<int> subset;
sort( S.begin(), S.end() );
findAllSubsets( S, subset, id );
return pool;
}
};