78. Subsets

最新推荐文章于 2021-02-13 18:11:08 发布

笨笨De蜗牛

最新推荐文章于 2021-02-13 18:11:08 发布

阅读量202

点赞数

分类专栏： LEETCODE

本文链接：https://blog.csdn.net/a342500329a/article/details/51413029

版权

LEETCODE 专栏收录该内容

155 篇文章 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],
[]
]
一道简单的DFS。

class Solution {
public:
    vector<vector<int>>res;
    vector<int>ans;
    vector<vector<int>> subsets(vector<int>& nums) {
        if(nums.size()==0) return res;
        sort(nums.begin(), nums.end());
        dfs(0,0, ans, nums);
        return res;

    }
    void dfs(int k, int t,vector<int>ans, vector<int> nums){
        if(t==nums.size())res.push_back(ans);
        for(int i = k; i < nums.size(); i++){
            ans.push_back(nums[i]);
            dfs(i+1,t+1,ans,nums);
            ans.pop_back();
            dfs(i+1,t+1,ans,nums);
        }
    }
};

而 Subsets II
Given a collection of integers that might contain duplicates, 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,2], a solution is:

[
[2],
[1],
[1,2,2],
[2,2],
[1,2],
[]
]
相比上一题是多了可以重复这个条件。

class Solution {
public:
    vector<vector<int>>res;
    vector<int>ans;
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        if(nums.size()==0) return res;
        sort(nums.begin(), nums.end());
        dfs(0,0, ans, nums);
        return res;
    }
    void dfs(int k, int t,vector<int>ans, vector<int> nums){
        res.push_back(ans);
        for(int i = k; i < nums.size(); i++){
            if(i>k&&nums[i]==nums[i-1])continue;
            ans.push_back(nums[i]);
            dfs(i+1,t+1,ans,nums);
            ans.pop_back();
        }
    }
};