Problem
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],
[]
]
Solution
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> ret;
vector<int> tmp;
backtrack(nums,0,tmp,ret);
return ret;
}
void backtrack(vector<int>& nums,int begin,vector<int> &tmp,vector<vector<int>> &ret)
{
ret.push_back(tmp);
for(int i = begin;i<nums.size();++i)
{
tmp.push_back(nums[i]);
backtrack(nums,i+1,tmp,ret);
tmp.pop_back();
}
}
};