力扣 题目90- 子集 II

题目

题解

直接在力扣 题目78- 子集修改 先排序 因为我们不知道后面有没有与前面重复的 所以排序后考虑一种情况 就是重复都在一起

那么我们只要在78题上判断一下重复即可

int loop(vector<int>& nums, vector<vector<int>>& result, vector<int>& alone, int begin) {
    int num = INT_MAX;
    for (int i = begin; i < nums.size(); i++) {
        if (nums[i]!= num) {
            num = nums[i];
            alone.push_back(nums[i]);
            result.push_back(alone);
            loop(nums, result, alone, i + 1);
            alone.pop_back();
        }
    }
    return 0;
}

代码

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int loop(vector<int>& nums, vector<vector<int>>& result, vector<int>& alone, int begin) {
    int num = INT_MAX;
    for (int i = begin; i < nums.size(); i++) {
        if (nums[i]!= num) {
            num = nums[i];
            alone.push_back(nums[i]);
            result.push_back(alone);
            loop(nums, result, alone, i + 1);
            alone.pop_back();
        }
    }
    return 0;
}
class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<vector<int>> result;
        result.push_back({});
        vector<int> alone;
        loop(nums, result, alone, 0);
        return result;
    }
};

int main() {
    Solution sol;
    vector<int> nums = { 1,2,3,2 };
    vector<vector<int>> result = sol.subsetsWithDup(nums);
    for (int i = 0; i < result.size(); i++) {
        for (int j = 0; j < result[i].size(); j++) {
            cout << result[i][j] << " ";
        }
        cout << endl;
    }
}