leetcode78 Subsets

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

Note:

• Elements in a subset must be in non-descending order.
• 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>> ans;
        vector<int> temp;
        ans.push_back(temp);
        sort(nums.begin(),nums.end());
        dep(nums,0,temp,ans);
        return ans;
    }
    void dep(vector<int>&nums,int p,vector<int>&temp,vector<vector<int>>&ans)
    {
        if(p>=nums.size())
        {
            if(temp.size()>0)
                ans.push_back(temp);
            return;
        }
        
        temp.push_back(nums[p]);
        dep(nums,p+1,temp,ans);
        temp.erase(temp.end()-1);
        dep(nums,p+1,temp,ans);
    }
};