[LeetCode] Subsets

[Problem]

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

[Solution]

class Solution {
public:
vector<vector<int> > subsets(vector<int> &S, int begin, int m){
vector<vector<int> > res;
if(m == 1){
for(int i = begin; i < S.size(); ++i){
vector<int> r;
r.push_back(S[i]);
res.push_back(r);
}
}
else{
for(int i = begin; i < S.size(); ++i){
vector<vector<int> > r = subsets(S, i+1, m-1);
for(int j = 0; j < r.size(); ++j){
r[j].insert(r[j].begin(), S[i]);
res.push_back(r[j]);
}
}
}
return res;
}

vector<vector<int> > subsets(vector<int> &S) {
// Start typing your C/C++ solution below
// DO NOT write int main() function

// insert an empty set
vector<vector<int> > res;
vector<int> tmp;
res.push_back(tmp);

// sort
sort(S.begin(), S.end());

// generate subsets
for(int i = 1; i <= S.size(); ++i){
vector<vector<int> > r = subsets(S, 0, i);
for(int j = 0; j < r.size(); ++j){
res.insert(res.begin(), r[j]);
}
}
return res;
}
};


 说明:版权所有,转载请注明出处。 Coder007的博客
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值