[leetcode][回溯] Subsets

最新推荐文章于 2020-07-19 17:24:31 发布

Clairezz_

最新推荐文章于 2020-07-19 17:24:31 发布

阅读量406

点赞数

分类专栏： leetcode 数据结构与算法

本文链接：https://blog.csdn.net/Clairezz_/article/details/45798889

版权

leetcode 同时被 2 个专栏收录

171 篇文章 0 订阅

订阅专栏

数据结构与算法

146 篇文章 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],
  []
]

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
	vector<vector<int> > res;
	if (nums.empty()) return res;
	vector<int> oneSubset;
	sort(nums.begin(), nums.end());//排序
	subsetsCore(nums, 0, oneSubset, res);
	return res;
}
private:
    void subsetsCore(vector<int>& nums, int start, vector<int> oneSubset, vector<vector<int> > &res){
	if (start == nums.size()){
		res.push_back(oneSubset);
		return;
	}
	subsetsCore(nums, start + 1, oneSubset, res);//start所指元素不在subset中
	oneSubset.push_back(nums[start]);
	subsetsCore(nums, start + 1, oneSubset, res);//start所指元素在subset中
}
};

注：由于题目中指明集合元素是“ distinct integers”，所以不必担心因含有重复元素而产生重复的子集的情况

下面是另一种思路，好像这种方法更通用一些，对于去重也比较方便

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
    vector<vector<int> > res;
	if (nums.empty()) return res;
	vector<int> oneSubset;
	sort(nums.begin(), nums.end());
	subsetsCore(nums, 0, oneSubset, res);
	return res;
    }
private:
    void subsetsCore(vector<int> &nums, int start, vector<int> oneSubset, vector<vector<int> > &res){
        res.push_back(oneSubset);
        for(int i = start; i < nums.size(); ++i){
            oneSubset.push_back(nums[i]);
            subsetsCore(nums, i+1, oneSubset, res);
            oneSubset.pop_back();
        }
    }
};