LeetCode-Subsets

最新推荐文章于 2025-08-11 20:54:26 发布

所难

最新推荐文章于 2025-08-11 20:54:26 发布

阅读量320

点赞数

CC 4.0 BY-SA版权

分类专栏： Cracking LeetCode Subset 文章标签： leetcode Subsets

本文链接：https://blog.youkuaiyun.com/HolyDominat/article/details/38454019

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

Subset

2 篇文章

订阅专栏

本文介绍了一种生成给定整数集合所有可能子集的算法，并提供了详细的C++实现代码。该算法确保了子集中元素的非递减顺序且不包含重复的子集。

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

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:

Code:

<span style="font-size:14px;">class Solution {
public:
    void helper(vector<int> &S, int index, const int &length, vector<vector<int> > &results, vector<int> &result) {
        for (int i = index; i < length; i++) {
            result.push_back(S[i]);
            results.push_back(result);
            helper(S, i+1, length, results, result);
            result.pop_back();
        }
    }
    
    vector<vector<int> > subsets(vector<int> &S) {
        vector<vector<int> > results;
        vector<int> result;
        results.push_back(result);
        int length = S.size();
        if (length == 0) return results;
        sort(S.begin(), S.end());
        helper(S, 0, length, results, result);
        return results;
    }
};</span>