lc90-Subsets II

發表於   |   分類於   |   0 comments   |   
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<int> sets;
        vector<vector<int> > ans;
        sort(nums.begin(), nums.end());
        ans.push_back(sets);
        backtracking(nums, 0, sets, ans);
        return ans;
    }
    void backtracking(vector<int>& nums, int start, vector<int> &sets, vector<vector <int>> &ans) {
        unsigned long len = nums.size();
        if (start >= len)
            return void();
        for (int i = start; i < len; i++) {
            if (i > start && nums[i] == nums[i-1])
                continue;
            sets.push_back(nums[i]);
            ans.push_back(sets);
            backtracking(nums, i + 1, sets, ans);
            sets.pop_back();
        }
    }
};