90. Subsets II

90. Subsets II

class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<vector<int>> subs;
        if(nums.empty())
            return subs;
        sort(nums.begin(), nums.end());
        vector<int> cur;
        DFS(0, nums, cur, subs);
        return subs;
    }
    void DFS(int start, vector<int>& nums, vector<int> &cur, vector<vector<int>> &subs){
        subs.push_back(cur);
        for(int i = start; i < nums.size(); i++){
            if(i != start && nums[i-1] == nums[i]){ //!!!
                continue;
            }
            cur.push_back(nums[i]);
            DFS(i+1, nums, cur, subs);
            cur.pop_back();
        }
    }