leetcode之subset II
来源:互联网 发布:詹姆斯深蹲力量数据 编辑:程序博客网 时间:2024/05/01 06:44
题目
Given a collection of integers that might contain duplicates, S, 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 S =[1,2,2], a solution is:
[ [2], [1], [1,2,2], [2,2], [1,2], []]实现
publicArrayList<ArrayList<Integer>> subsetsWithDup(int[] num) {
ArrayList<ArrayList<Integer>>res = new ArrayList<>();
if(num == null || num.length == 0) {
returnres;
}
Arrays.sort(num);
ArrayList<Integer>list = new ArrayList<>();
solve(num,0, res, list);
returnres;
}
privatevoid solve(int[] num, int start, ArrayList<ArrayList<Integer>> res,ArrayList<Integer> list) {
res.add(newArrayList<>(list));
if(start >= num.length)
return;
for(int i = start; i < num.length; i++) {
if(i > start && num[i] == num[i - 1]) {
continue;
}
list.add(num[i]);
solve(num,i + 1, res, list);
list.remove(list.size()- 1);
}
}
- 【Leetcode】之Subset II
- leetcode之subset II
- Leetcode Subset I & II
- LeetCode(90)Subset II
- LeetCode 练习: Subset ii
- 【leetcode】 subset I、II
- Subset II [Leetcode 解题报告]
- LeetCode 90.Subset II java solution
- subset II
- leetcode Subset
- leetcode subset ||
- leetcode subset
- Subset I & II
- leetcode之Permutations II
- LeetCode之Subsets II
- leetcode之Subsets II
- 【Leetcode】之Permutations II
- LeetCode(78)Subset
- 模拟JVM内存溢出
- eclipse项目导入GitHub
- spring学笔记七
- HTTP Status 500
- js-格式化当前日期
- leetcode之subset II
- Java中的length和length()深入分析
- 2017-09-05
- 最小生成树Prim算法模板
- Windows与linux下caffe配置(仅CPU)
- 观察者模式的C#实现
- Android面试——Fragment相关
- 记一次实现统计访问量最高文章的功能
- 因特网(Internet)与万维网(www)区别