# Subsets II

156人阅读 评论(0)

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;
}
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：66180次
• 积分：1301
• 等级：
• 排名：千里之外
• 原创：70篇
• 转载：19篇
• 译文：0篇
• 评论：2条
评论排行
最新评论