leetcode刷题，总结，记录，备忘 90

最新推荐文章于 2024-06-05 18:14:23 发布

guicaisa

最新推荐文章于 2024-06-05 18:14:23 发布

阅读量233

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/guicaisa/article/details/51116316

版权

leetcode 专栏收录该内容

128 篇文章 0 订阅

订阅专栏

leetcode90Subsets II

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

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

Subscribe to see which companies asked this question

跟与其一个系列的题目的类似，，，解法也是相同的，使用深度优先，具体说明跟之前的第一题类似http://blog.csdn.net/guicaisa/article/details/50976084

直接上代码，不多做解释了。

class Solution {
public:
    vector<vector<int> > result;
    vector<int> temp;
    
    void function(vector<int> nums, int deep)
    {
        if (deep == nums.size())
        {
            return;
        }
        
        for (int i = deep; i < nums.size(); ++i)
        {
            temp.push_back(nums[i]);
            result.push_back(temp);
            function(nums, i + 1);
            temp.pop_back();
        }
    }

    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        if (nums.size() == 0)
        {
            return result;
        }
        
        sort(nums.begin(), nums.end());
        function(nums, 0);
        
        set<vector<int> > si(result.begin(), result.end());
        vector<vector<int> > t(si.begin(), si.end());
        t.push_back(vector<int>());
        
        return t;
    }
};