Leetcode 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.

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

[
[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> > ret;
        vector<int> ans;
        ret.push_back(ans);
        resubset(nums, 0, ans, ret);
        return ret;

    }
    void resubset(vector<int>& nums, size_t id, vector<int>& ans, vector<vector<int> >& ret) {
        if (id == nums.size()) return;
        for (size_t i = id; i != nums.size(); ++i) {
            ans.push_back(nums[i]);
            ret.push_back(ans);
            resubset(nums, i + 1, ans, ret);
            ans.pop_back();
        }
    }
};