LeetCode-Subsets II

最新推荐文章于 2019-04-09 21:05:38 发布

原创最新推荐文章于 2019-04-09 21:05:38 发布 · 274 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Subsets II

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

Subset

2 篇文章

订阅专栏

本文讨论了如何在给定可能包含重复元素的整数集合S的情况下，找到所有可能的子集，并确保子集内的元素按非降序排列且不包含重复子集。

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

Given a collection of integers that might contain duplicates, 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,2], a solution is:

[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

Solution:

Code:

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