# Subsets II

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],
[]
]

public class Solution {
public void helper(List<List<Integer>> res, List<Integer> item, int start, int[] nums, boolean[] isVisited) {
for(int i = start; i < nums.length; i ++) {
if(i > start && nums[i] == nums[i - 1])
continue;
if(!isVisited[i]) {
isVisited[i] = true;
helper(res, item, i + 1, nums, isVisited);
isVisited[i] = false;
item.remove(item.size() - 1);
}
}
}

//It can only can use the solution 1 of Subsets 1
public List<List<Integer>> subsetsWithDup(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
if(nums == null || nums.length == 0)
return res;
Arrays.sort(nums);
helper(res, new ArrayList<Integer>(), 0, nums, new boolean[nums.length]);
return res;
}
}
• 本文已收录于以下专栏：

## Leetcode : Subsets II

URL：https://leetcode.com/problems/subsets-ii/#/description题目大意：Given a collection of integers that m...

## leetcode 90. Subsets II

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

## 【leetcode】90. Subsets II

leetcode, subsets ||， 3种解法

## leetcode：暴力枚举法之Subsets II

leetcode：暴力枚举法之Subsets II 题目; Given a collection of integers that might contain duplicates, S, retur...

## LeetCode OJ:Subsets II

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

Subsets I and II

## Subsets II -- leetcode

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

## leetcode 90 Subsets II

leetcode 90 Subsets II c++ Python

## LeetCode Subsets II (带有重复元素的组合)

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

举报原因： 您举报文章：Subsets II 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)