leetcode-78. 子集

 

 

此题dfs用的出神入化

class Solution {
public:
    vector<vector<int>> res;
    vector<int> temp;
    vector<vector<int>> subsets(vector<int>& nums) {
        dfs(nums,0);
        return res;
    }
    void dfs(vector<int> nums, int count){
        if(count==nums.size()){
            res.push_back(temp);
            return;
        }
        temp.push_back(nums[count]);
        dfs(nums,count+1);
        temp.pop_back();
        dfs(nums,count+1);
    }
};