和Leetcode 78. 子集类似,注意存在重复数这个条件即可
class Solution {
public:
vector<vector<int>> ans;
vector<int> tmp;
vector<int> vis;
void dfs(int cnt, vector<int>& nums, int index) {
if (!cnt) {
ans.push_back(tmp); return;
}
int i = index;
do {
while (i > 0 && i<nums.size() && nums[i] == nums[i - 1] && !vis[i - 1]) ++i;//针对重复数
if (i + cnt - 1 >= nums.size()) break;
tmp.push_back(nums[i]), vis[i] = 1, dfs(cnt - 1, nums, i + 1), tmp.pop_back(), vis[i] = 0;
} while (++i);
}
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
sort(nums.begin(), nums.end());
vis.assign(nums.size(), 0);
for (int k = 0; k <= nums.size(); ++k)
dfs(k, nums, 0);
return ans;
}
};