【LeetCode】Subsets & Subsets II

最新推荐文章于 2020-11-22 19:54:00 发布

Snowwolf_Yang

最新推荐文章于 2020-11-22 19:54:00 发布

阅读量479

点赞数

分类专栏：排列组合 LeetCode

本文链接：https://blog.csdn.net/snowwolf_yang/article/details/24268623

版权

LeetCode 同时被 2 个专栏收录

86 篇文章 0 订阅

订阅专栏

排列组合

3 篇文章 0 订阅

订阅专栏

题目描述

Subsets

Given a set of distinct integers, S, 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 S = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

Subsets II

Given a collection of integers that might contain duplicates, S, 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 S = [1,2,2], a solution is:

[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

题目分析

总结

代码示例

class Solution {
public:
    vector<vector<int> > subsets(vector<int> &S) {
        vector<vector<int> > ret;
        vector<int> tmp;
        sort(S.begin(),S.end()); 
        subsetsCore(ret,0,S,tmp);
        return ret;
    }
    void subsetsCore(vector<vector<int> > &ret,int index,vector<int> &S,vector<int> &tmp)
    {
    	if(index == S.size())
    	{
    		ret.push_back(tmp);
    		return;
    	}
    	for(int i = index;i<S.size();i++)
    	{
    		tmp.push_back(S[i]);
   			subsetsCore(ret,i+1,S,tmp);
   			tmp.pop_back();
		}
		ret.push_back(tmp);
	}
};

class Solution {
public:
    vector<vector<int> > subsetsWithDup(vector<int> &S) {
        vector<vector<int> > ret;
        vector<int> tmp;
        sort(S.begin(),S.end()); 
        subsetsWithDupCore(ret,0,S,tmp);
        return ret;
    }
    void subsetsWithDupCore(vector<vector<int> > &ret,int index,vector<int> &S,vector<int> &tmp)
    {
    	if(index == S.size())
    	{
    		if(find(ret.begin(),ret.end(),tmp) == ret.end())
    			ret.push_back(tmp);
    		return;
    	}
   		subsetsWithDupCore(ret,index+1,S,tmp);
   		tmp.push_back(S[index]);
   		subsetsWithDupCore(ret,index+1,S,tmp);
   		tmp.pop_back();
	}
};