class Solution {
public:
vector<int> path;
vector<vector<int>> result;
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
result.push_back(path);
sort(nums.begin(),nums.end());
traverse(nums,0);
return result;
}
void traverse(vector<int>& nums, int start_index){
if(start_index>=nums.size()) return;
for(int i=start_index;i<nums.size();i++){
if(i!=start_index&&nums[i]==nums[i-1])
continue;
path.push_back(nums[i]);
result.push_back(path);
traverse(nums,i+1);
path.pop_back();
}
}
};
刷题记录第九十三天-子集II-先排序后去重
最新推荐文章于 2024-07-22 15:15:29 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)