Leetcode #78 Subsets

最新推荐文章于 2021-01-24 15:46:22 发布

每天都要有进步

最新推荐文章于 2021-01-24 15:46:22 发布

阅读量300

点赞数

分类专栏： Leetcode 暑假备战UVa

本文链接：https://blog.csdn.net/u011472124/article/details/47177173

版权

Leetcode 同时被 2 个专栏收录

262 篇文章 0 订阅

订阅专栏

暑假备战UVa

103 篇文章 0 订阅

订阅专栏

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],
  []
]

Difficulty: Medium

void gen(vector<vector<int> >& ans,vector<int>& v,vector<int>& nums,int dep,int n,int index){
        if(dep<=0||index>n-1)
            return;
        vector<int> v1 = v;
        while(index<=n-dep)
        {
            v1.push_back(nums[index]);
            if(dep==1)
                ans.push_back(v1);
            else
                gen(ans,v1,nums,dep-1,n,index+1);
            v1 = v;
            index++;
        }
        
    }

    vector<vector<int> > subsets(vector<int>& nums) {
        vector<int> v;
        vector<vector<int> > ans;
        ans.push_back(v);
        sort(nums.begin(),nums.end());
        //ans.push_back(nums);
        int i = 1;
        int len = nums.size();
        while(i<=len)
        {
            gen(ans,v,nums,i,len,0);
            i++;
        }
        return ans;
        
        
    }