78. Subsets --M

Given an integer array nums of unique elements, return all possible  (the power set).

The solution set must not contain duplicate subsets. Return the solution in any order.

 

Example 1:

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

Example 2:

Input: nums = [0]
Output: [[],[0]]

 

Constraints:

• 1 <= nums.length <= 10
• -10 <= nums[i] <= 10
• All the numbers of nums are unique.

A:

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> res{{}};
        for(auto v : nums){
            int c = res.size();
            for(int i =0;i<c;i++){
                vector<int> tmp = res[i];
                tmp.emplace_back(v);
                res.emplace_back(tmp);
            }
        }
        return res;
    }
};

Mistakes: