-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpowerSet.cpp
40 lines (35 loc) · 955 Bytes
/
powerSet.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
#include <iostream>
#include <vector>
using namespace std;
void solve(vector<int> nums, int index, vector<int> output,
vector<vector<int>>& answer) {
if (index >= nums.size()) {
answer.push_back(output);
return;
}
solve(nums, index + 1, output, answer);
output.push_back(nums[index]);
solve(nums, index + 1, output, answer);
}
int main() {
vector<int> nums = {1, 2, 3, 4};
vector<int> output;
vector<vector<int>> answer;
int index = 0;
solve(nums, index, output, answer);
cout << "Array: {";
for (int i = 0; i < nums.size(); i++) {
cout << nums[i];
if (i != nums.size() - 1) cout << ",";
}
cout << "}" << endl << "Total elements: " << answer.size() << endl;
for (int i = 0; i < answer.size(); i++) {
cout << "{";
for (int j = 0; j < answer[i].size(); j++) {
cout << answer[i][j];
if (j != answer[i].size() - 1) cout << ",";
}
cout << "}" << endl;
}
return 0;
}