[LeetCode] Subsets

最新推荐文章于 2019-04-17 12:01:23 发布

HQBUPT

最新推荐文章于 2019-04-17 12:01:23 发布

阅读量545

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： LeetCode 刷题

本文链接：https://blog.csdn.net/HQBUPT/article/details/37737345

LeetCode 专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一种使用C++实现的组合与子集生成算法。该算法通过递归方式生成给定数组的所有可能组合及子集，适用于解决排列组合问题。文章提供了完整的代码示例并详细解释了每一步的操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

vector<vector<int>> combine(vector<int> &nums, int k) {
	vector<vector<int>> combinations;
	if (k == 0)
	{
		vector<int> combination;
		combinations.push_back(combination);
		return combinations;
	}
	if (k == nums.size())
	{
		combinations.push_back(nums);
		return combinations;
	}
	vector<int> nums_tmp = nums;
	int comboNum = nums[0];
	nums_tmp.erase(nums_tmp.begin(), nums_tmp.begin()+1);
	vector<int> combination;
	combination.push_back(comboNum);
	vector<vector<int>> combinationsWithoutComboNum = combine(nums_tmp, k-1);
	for (int j = 0; j < combinationsWithoutComboNum.size(); j++)
	{
		vector<int> combination = combinationsWithoutComboNum[j];
		combination.insert(combination.begin(), comboNum);
		combinations.push_back(combination);
	}
	combinationsWithoutComboNum = combine(nums_tmp, k);
	for (int j = 0; j < combinationsWithoutComboNum.size(); j++)
	{
		vector<int> combination = combinationsWithoutComboNum[j];
		combinations.push_back(combination);
	}
	return combinations;
}
vector<vector<int> > subsets(vector<int> &S) {
    sort(S.begin(), S.end());
    vector<vector<int>> subsets;
	for (int i = 0; i <= S.size(); i++)
    {
		vector<vector<int>> subsets_tmp = combine(S, i);
		subsets.insert(subsets.end(), subsets_tmp.begin(), subsets_tmp.end());	
    }
	return subsets;
}