Leetcode之Subsets II

题目：

Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: [1,2,2]
Output:
[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

代码：

class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        	vector<vector<int>>res;
	vector<int> empty;
	res.push_back(empty);
    sort(nums.begin(),nums.end());
	for (int i = 0; i < nums.size(); i++) {
		int len = res.size();
		for (int j = 0; j < len; j++) {
			vector<int> v = res[j];
			v.push_back(nums[i]);
			if (i == 0 || nums[i] != nums[i - 1]) {
				res.push_back(v);
			}
			else {
				vector<vector<int>>::iterator it;
				it = find(res.begin(), res.end(), v);
				if (it == res.end())res.push_back(v);
			}
		}
	}
	return res;
    }
};

想法：

注意细节