【leetcode】Array——SubsetsII（90）

Given a collection of integers that might contain duplicates, nums, 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 nums = [1,2,2], a solution is:

[

  [2],

  [1],

  [1,2,2],

  [2,2],

  [1,2],

  []

]

投机取巧，按照上一道题的思路，但是最后用set过滤重复。

    public List<List<Integer>> subsetsWithDup(int[] nums) {

    List<List<Integer>> results_L = new ArrayList<>();

    Set<List<Integer>> results = new HashSet<>();

results.add(new ArrayList<Integer>());

 

if (nums.length==0)

return results_L;

 

Arrays.sort(nums);

 

for(int i:nums){

List<List<Integer>> temp = new ArrayList<>();

for(List<Integer> list:results){

List<Integer>a = new ArrayList<>(list);

a.add(i);

temp.add(a);

}

  results.addAll(temp);

}

results_L.addAll(results);

return results_L;

     }