Subsets - LeetCode

Given a set of distinct integers, nums, return all possible subsets.

Note:

• Elements in a subset must be in non-descending order.
• The solution set must not contain duplicate subsets.

 

For example,
If nums = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

思路：将nums数组先排序。然后依次枚举每一位在或者不在的情况。根据要求，当我们枚举了某一位为存在的情况时，则该位前面的数都不能再枚举了，因为要求结果是增长序列。此外，记得不要漏了空集的情况。

class Solution {
public:
    void help(vector<vector<int> >& res, vector<int>& nums, vector<int>& cur, int st)
    {
        if (st == nums.size())
            return;
        for (int i = st, n = nums.size(); i < n; i++)
        {
            cur.push_back(nums[i]);
            res.push_back(cur);
            help(res, nums, cur, i + 1);
            cur.erase(cur.begin() + cur.size() - 1);
        }
    }
    vector<vector<int>> subsets(vector<int>& nums) {
        sort(nums.begin(), nums.end(), less<int>());
        vector<vector<int> > res;
        vector<int> tem;
        res.push_back(tem);
        help(res, nums, tem, 0);
        return res;
    }
};