class Solution {
public:
vector<vector<int>> ans;
vector<vector<int>> subsets(vector<int>& nums)
{
vector<int> temp;
find(nums,ans,temp,0);
return ans;
}
void find(vector<int>& nums,vector<vector<int>>& ans,vector<int>& temp,int lenth)
{
ans.push_back(temp);
if(lenth==nums.size())
{
//ans.push_back(temp);
return ;
}
for(int i=lenth;i<nums.size();i++)
{
temp.push_back(nums[i]);
find(nums,ans,temp,i+1);
temp.pop_back();
}
return;
}
};