Given a collection of integers that might contain duplicates, nums, return all possible subsets.
Note: The solution set must not contain duplicate subsets.
For example,
If nums = [1,2,2], a solution is:

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

方法

設定返回的列表的列表為result。先對數(shù)組排序，如果nums[i]!=nums[i-1]，那么就遍歷result，復制每個列表為tempList，加入nums[i]，然后將該列表加入result中；如果nums[i]==nums[i-1]，那么記錄下加入nums[i-1]前返回列表的大小resultIndex，resultSize為加入nums[i-1]后的大小，對result中從resultIndex至resultSize的列表加入nums[i]，然后將新生成的列表加入result

代碼

class Solution(object):
    def subsetsWithDup(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        result = [[]]
        nums.sort()
        i = 0
        resultSize = 0
        while i < len(nums):
            num = nums[i]
            resultIndex = 0
            if i>0 and nums[i]==nums[i-1]:
                resultIndex = resultSize;
            resultSize = len(result)
            while resultIndex < resultSize:
                tempList = result[resultIndex][:]
                tempList.append(num)
                result.append(tempList)
                resultIndex += 1
            i += 1
        return result

assert Solution().subsetsWithDup([1,2,2]) == [[],[1],[2],[1,2],[2,2],[1,2,2]]