题目
代码(首刷自解)
class Solution {
public:
vector<vector<int>> res;
vector<int> ans;
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
function<void(int)> dfs = [&](int k) {
res.push_back(ans);
for(int i = k; i < nums.size(); i++) {
if(i != k && nums[i] == nums[i-1]) continue;
ans.push_back(nums[i]);
dfs(i+1);
ans.pop_back();
}
};
sort(nums.begin(), nums.end());
dfs(0);
return res;
}
};