78. Subsets 解法二

78. Subsets

题目：

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

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>> result;
        vector<vector<int>> answer;
        vector<int> store;
        for (int i = 0; i <= nums.size(); i++) {
            getSub(store, result, nums, 0, i);
            for (int j = 0; j < result.size(); j++)
                answer.push_back(result[j]);
            result.clear();
        }
        return answer;
    }
    void getSub(vector<int>& store, vector<vector<int>>& result, vector<int>& nums, int start, int len) {
        if (store.size() == len) {
            result.push_back(store);
            return;
        }
        for (int i = start; i < nums.size(); i++) {
            store.push_back(nums[i]);
            getSub(store, result, nums, i + 1, len);
            store.pop_back();
        }
    }
};