leetcode 78. Subsets

最新推荐文章于 2025-09-10 22:03:14 发布

zbxzc

最新推荐文章于 2025-09-10 22:03:14 发布

阅读量430

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法 OJ 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/u014568921/article/details/50991686

数据结构与算法同时被 2 个专栏收录

213 篇文章

订阅专栏

196 篇文章

订阅专栏

本文介绍了一种用于从给定整数集合中生成所有唯一子集的算法实现过程，包括选择操作和排序步骤，确保子集不重复且按非降序排列。

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 {
	void choose_one(vector<pair<vector<int>, vector<int>>>&candi)
	{
		vector<pair<vector<int>, vector<int>>>newcandi;
		for (int i = 0; i < candi.size(); i++)
		{
			for (int j = 0; j < candi[i].second.size(); j++)
			{
				vector<int>bb = candi[i].first;
				bb.push_back(candi[i].second[j]);
				vector<int>cc = candi[i].second;
				cc.erase(cc.begin(), cc.begin() + j + 1);
				newcandi.push_back(pair<vector<int>, vector<int>>(bb, cc));
			}
		}
		candi = newcandi;
	}
public:
	vector<vector<int>> subsets(vector<int>& nums) {
		vector<vector<int>>re;
		vector<int>aa,a;
		re.push_back(aa);
		sort(nums.begin(), nums.end());
		vector<pair<vector<int>, vector<int>>>candi;
		candi.push_back(pair<vector<int>, vector<int>>(a, nums));
		int k = 0;
		while (k < nums.size())
		{
			choose_one(candi);
			for (int i = 0; i < candi.size(); i++)
				re.push_back(candi[i].first);
			k++;
		}
		return re;
	}
};

accepted