一、题目
二、代码
class Solution
{
public:
vector<vector<int>> return_vector;
vector<int> path;
void track_back(int start_point, vector<int>& nums)
{
int i,j;
return_vector.push_back(path);
if(start_point==nums.size()) return;
else
{
for(i=start_point;i<nums.size();i++)
{
path.push_back(nums[i]);
track_back(i+1,nums);
path.pop_back();
}
}
}
vector<vector<int>> subsets(vector<int>& nums)
{
return_vector.clear();
path.clear();
track_back(0,nums);
return return_vector;
}
};