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<int> ivec;
vector<vector<int> > res;
sort(nums.begin(),nums.end());
generatesub(nums,0,ivec,res);
return res;
}
// backtarcing
void generatesub(vector<int> &nums,int k,vector<int> temp,vector<vector<int> > &res){
res.push_back(temp);
for(int i=k;i<nums.size();++i){
temp.push_back(nums[i]);
generatesub(nums,i+1,temp,res);
temp.pop_back();
}
}
};