[LeetCode] 109: Subsets

最新推荐文章于 2023-11-09 12:19:18 发布

1.02^365的成长裂变

最新推荐文章于 2023-11-09 12:19:18 发布

阅读量3.5k

点赞数

分类专栏： LeetCode2

本文链接：https://blog.csdn.net/raojunyang/article/details/77925270

版权

LeetCode2 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

[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) {
		// Note: The Solution object is instantiated only once and is reused by each test case.
		
		// result
		vector<vector<int> >res;
		if(S.size() == 0)return res;

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

		// generate subsets
		long long total = pow(2, S.size());
		for(long long i = 0; i < total; ++i){
			vector<int> row;
			for(int j = 0; j < S.size(); ++j){
				if((i >> j) & 1 == 1){
					row.push_back(S[j]);
				}
			}
			if(find(res.begin(), res.end(), row) == res.end()){
				res.push_back(row);
			}
		}
		return res;
	}
};