给定一个可能包含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
说明:解集不能包含重复的子集。
示例:
输入: [1,2,2] 输出: [ [2], [1], [1,2,2], [2,2], [1,2], [] ]
代码运行结果:
#include <stdio.h>
#include <cstring>
#include <iostream>
#include <queue>
#include <cctype>
#include <map>
#include <set>
#include <algorithm>
#include <iomanip>
#include <cstdlib>
using namespace std;
vector<vector<int>> myrs;
void help2(vector<int>& nums, int i, int len, vector<int>& temp){
myrs.push_back(temp);
for(int m = 0; m < temp.size(); m++){
cout<<temp.at(m)<<" ";
}
cout<<endl;//这段代码用来打印子集
for(int j=i; j < len; j++){
if(j>i&&nums[j]==nums[j-1]) continue;//同一层(递归深度)跳过相同元素,注意不同层(递归深度)是不会跳过的
temp.push_back(nums[j]);
help2(nums, j+1, len, temp);
temp.pop_back();
}
}
vector<vector<int>> subsetsWithDup2(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<int> temp;
help2(nums, 0, nums.size(), temp);
return myrs;
}
int main(){
vector<int> nums = {1,2,3,3,4,5};
subsetsWithDup2(nums);
return 0;
}
LeetCode:版本
class Solution {
public:
vector<vector<int>> rs;
void help(vector<int>& nums, int i, int len, vector<int>& temp){
rs.push_back(temp);
for(int j=i; j < len; j++){
if(j>i&&nums[j]==nums[j-1]) continue;
temp.push_back(nums[j]);
help(nums, j+1, len, temp);
temp.pop_back();
}
}
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<int> temp;
help(nums, 0, nums.size(), temp);
return rs;
}
};