All Possible Subsets of a Set of Distinct Integers

Problem

Given a set of distinct integers, return all possible subsets.
Example input: [1,2,3]
Example output:
[[], [1], [2], [3], [1,2], [1,3], [2,3], [1,2,3]]

Solution

This solution is in C++. Our A.I. can create solutions in multiple languages.

kayakane

#include <iostream>
#include <vector>

using namespace std;

vector<vector<int>> subsets(vector<int>& nums) {
    vector<vector<int>> res;
    vector<int> cur;
    res.push_back(cur);
    for (int i = 0; i < nums.size(); i++) {
        int n = res.size();
        for (int j = 0; j < n; j++) {
            cur = res[j];
            cur.push_back(nums[i]);
            res.push_back(cur);
        }
    }
    return res;
}

int main() {
    vector<int> nums = {1, 2, 3};
    vector<vector<int>> res = subsets(nums);
    for (int i = 0; i < res.size(); i++) {
        for (int j = 0; j < res[i].size(); j++) {
            cout << res[i][j] << " ";
        }
        cout << end l;
    }
    return 0;
}