[LeetCode] Subsets II

class Solution {
public:
vector<vector<int> > result;
void dfs(vector<int> &num,int deep,int maxDeep,vector<int> a,int start){
result.push_back(a);
if(deep == maxDeep) return;
bool flag = false;
for(int i = start;i < num.size();i ++){
if(flag == false){
vector<int>b(a);
b.push_back(num[i]);
dfs(num,deep + 1,maxDeep,b,i + 1);
}
if(i < num.size() - 1 && num[i + 1] == num[i]) flag = true;
if(i < num.size() - 1 && num[i + 1] != num[i]) flag = false;

}
}
vector<vector<int> > subsetsWithDup(vector<int> &S) {
sort(S.begin() , S.end());
vector<int> a;
dfs(S,0,S.size(),a,0);
return result;
}
};