LeetCode 刷题记录 90. 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],
[]
]
解法1：
回溯法
首先对数据进行排序然后
用

if(i > start && nums[i] == nums[i-1]) continue;

去重

c++：

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

java：

class Solution {
    public List<List<Integer>> subsetsWithDup(int[] nums) {
    List<List<Integer>>  res = new ArrayList<>();
        List<Integer> path = new ArrayList<>();
        Arrays.sort(nums);
        DFS(nums, path, res, 0);
        return res;

    }
    private void DFS(int[] nums, List<Integer> path,List<List<Integer>> res,int start){
        
       
        
        res.add(new ArrayList<>(path));
       
        for(int i = start; i < nums.length ; ++i){
            if(i > start && nums[i] == nums[i-1]) continue;
            path.add(nums[i]);
            DFS(nums, path, res, i+1);
            path.remove(path.size() - 1);
        }
        
    }
}

python：

class Solution(object):
    def subsetsWithDup(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        res = []
        nums.sort()
        self.DFS(nums, [], res, 0)
        return res
    def DFS(self, nums, path, res,start):
        
        
        res.append(path)
            
        for i in xrange(start, len(nums)):
            if i > start and nums[i] == nums[i-1]: continue
            self.DFS(nums, path + [nums[i]], res, i+1)