78. Subsets

https://leetcode.com/problems/subsets/

Problem

Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: nums = [1,2,3]
Output:
[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

Solution

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums){
        vector<vector<int>> power_set{{}};
        if (nums.empty()) return power_set;
        for (int i = 0; i < nums.size(); ++i) {
            vector<vector<int>> dump(power_set);
            for (auto &e: dump) e.push_back(nums[i]);
            power_set.insert(power_set.end(), dump.begin(), dump.end());
        }
        return power_set;
    }
};

• #dp