78. Subsets leetcode

78. Subsets
    Medium

1845

49

Favorite

Share
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],
[]
]

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> res;
        int n=nums.size();
        if(!n)return res;
        res.push_back({});//首先压入一个空集
        for(int num:nums){//从nums取数一个一个加进去
            int n=res.size();//当前res的大小
            for(int i=0;i<n;++i){
                auto t=res[i];
                t.push_back(num);//res里的值 每一个加入新的num 然后在存入res里
                res.push_back(t);
            }  
        }
        return res;    
    }
};