有点难顶,看了几个题解都属于那种能过的就行,不考虑乱序排列比如这
虽然力扣的示例能跑过去,但是自己想个他就跑不过了(手动滑稽)
看了最靠谱的一个
虽然自己想不到这种思想 但是,他确实可以实现去重 没得办法谁让我是个菜狗呢!
代码
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int>>res;
vector<int> path;
sort(nums.begin(), nums.end());
rec(nums, path, 0, res);
return res;
}
void rec(vector<int> &nums, vector<int>&path,int start,vector<vector<int>>&res)
{
res.push_back(path);
int pre = -11;
for (int i = start; i < nums.size(); i++)
{
if (pre != nums[i])
{
pre = nums[i];
path.push_back(nums[i]);
rec(nums, path, i + 1, res);
path.pop_back();
}
}
}
};