LeetCode: Subsets II

Given a collection of integers that might contain duplicates, S, return all possible subsets.

Note:

• Elements in a subset must be in non-descending order.
• The solution set must not contain duplicate subsets.

For example,
If S = [1,2,2], a solution is:

[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

有重复数的不重复组合。

class Solution {
public:
    void comb(vector<int> &S, vector<int> &count, vector<vector<int> > &result,   
              vector<int> &tmp, int size, int n, int pos)  
    {  
        vector<int> v;  
        for (int i = 0; i < n; ++i)  
            v.push_back(tmp[i]);  
        result.push_back(v);  
          
        for (int i = pos; i < size; ++i)  
        { 
            if (count[i] > 0)
            {
                --count[i];
                tmp[n] = S[i];  
                comb(S, count, result, tmp, size, n+1, i);
                ++count[i];
            }
        }  
    }  
    vector<vector<int> > subsetsWithDup(vector<int> &S) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int nSize = S.size();
        vector<vector<int> >result;
        sort(S.begin(), S.end());
        
        vector<int> s;
        vector<int> count;
        int val = S[0];
        int num = 1;
        for (int i = 1; i < nSize; ++i)
        {
            if (S[i] == val)
            {
                ++num;
            }
            else
            {
                s.push_back(val);
                count.push_back(num);
                val = S[i];
                num = 1;
            }
        }
        s.push_back(val);
        count.push_back(num);
        
        vector<int> tmp(nSize);  
        comb(s, count, result, tmp, s.size(), 0, 0);  
        return result;  
    }
};