78. Subsets

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;
        if (nums.size() == 0)
            return result;
        vector<int> res;
        result.push_back(res);
        Helper(nums, result,res, 0);
        return result;
    }
private: 
    void Helper(vector<int>& nums, vector<vector<int>> &result, vector<int>& res, int i)
    {
        if (i >= nums.size())
            return;

        res.push_back(nums[i]);
        result.push_back(res);
        Helper(nums, result, res, i + 1);
        res.pop_back();
        Helper(nums, result, res, i + 1);

    }
};

方法二：位运算法

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> result;
        if (nums.size() == 0)
            return result;
        int count = 1 << nums.size();
        for (int i = 0; i < count; i++)
        {
            vector<int> res;
            for (int j = 0; j < nums.size(); j++)
            {
                if (i&(1 << j))
                {
                    res.push_back(nums[j]);
                }
            }
            result.push_back(res);
        }
        return result;
    }
};