LeetCode78 子集

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>> result;
        vector<int> item;
        result.push_back(item);
        generate(0,nums,result,item);
        return result;
    }
private:
    void generate(int i,vector<int>& nums,vector<vector<int>>& result,vector<int> &item){
        if(i>=nums.size()){
            return;
        }
        item.push_back(nums[i]);
        result.push_back(item);
        generate(i+1,nums,result,item);
        item.pop_back();
        generate(i+1,nums,result,item);
    }
};