-
Notifications
You must be signed in to change notification settings - Fork 1
/
78_Subsets.cpp
51 lines (41 loc) · 1.13 KB
/
78_Subsets.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
//ACCEPTED!!!!
#include <iostream>
#include <vector>
using namespace std;
vector< vector<int> > ans;
class Solution {
public:
void rec(vector<int>& nums, int len, int ind, vector<int>& arr_so_far){
if(len == 0){
ans.push_back(arr_so_far);
return;
}
if(ind >= nums.size()) return;
for(int i = ind; i < nums.size(); i++){
arr_so_far.push_back(nums[i]);
rec(nums, len - 1, i + 1, arr_so_far);
arr_so_far.pop_back();
}
}
vector< vector<int> > subsets(vector<int>& nums) {
vector<int> arr_so_far;
int nums_len = nums.size();
for(int len = 0; len <= nums.size(); len++)
rec(nums, len, 0, arr_so_far);
return ans;
}
};
int main(){
Solution* p;
vector<int> input;
input.push_back(1);input.push_back(2);input.push_back(2);input.push_back(2);input.push_back(5);
vector< vector<int> > ans = p->subsets(input);
for(int i = 0; i < ans.size(); i++){
if(ans[i].size()==0) cout << "[]";
for(int j = 0; j < ans[i].size(); j++){
cout << ans[i][j]<< " ";
}
cout << endl;
}
return 0;
}