78.leetcode Subsets(medium)[回溯递归循环调用combination即可]

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

Note: 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:
    void getCombine(int start,int step,int n,vector<int> &subsets,vector<vector<int> > &result,vector<int> &temp)
    {
        if(step == 0)
        {
            if(temp.size() != 0)
            {
                result.push_back(temp);
            }
            return;
        }
        for(int i=start;i<=n-step;i++)
        {
            temp.push_back(subsets[i]);
            getCombine(i+1,step-1,n,subsets,result,temp);
            temp.pop_back();
        }
        return ;
    }
    vector<vector<int>> subsets(vector<int>& nums) {
         int n = nums.size();
         vector<vector<int> > result;
         if(n<=0) return result;
         vector<int> em;
         result.push_back(em);
         for(int k=1;k<=n;k++)
         {   
             vector<int> temp;
             getCombine(0,k,n,nums,result,temp);
         }
         return result;
    }
};