Subsets II (contains duplicates)
来源:互联网 发布:淘宝网争议处理规则 编辑:程序博客网 时间:2024/06/07 12:29
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], []]代码如下:
import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class SubsetsIIContainsDuplicates {public List<ArrayList<Integer>> subsetsII(int[] nums){List<ArrayList<Integer>> list = new ArrayList<>();Arrays.sort(nums);backtrack(list,new ArrayList<>(),nums,0);return list;}private void backtrack(List<ArrayList<Integer>> list, ArrayList<Integer> arrayList, int[] nums, int start) {list.add(new ArrayList<>(arrayList));for(int i=start; i<nums.length;i++){if(i>start && nums[i]==nums[i-1])//防止重复的组合出现continue;arrayList.add(nums[i]);backtrack(list,arrayList,nums,i+1);arrayList.remove(arrayList.size()-1);}}}
阅读全文
0 0
- Subsets II (contains duplicates)
- 【Leetcode】Contains Duplicates II #I love HashTable#
- (*)Subsets II
- LeetCode(90) Subsets II
- Leetcode_c++: Subsets II (090)
- 【LeetCode】 Subsets Subsets II
- 【LeetCode】Subsets & Subsets II
- LeetCode Subsets && Subsets II
- Subsets and Subsets II
- LeetCode Subsets && Subsets II
- LeetCode-Subsets & Subsets II
- Subsets II
- Subsets II
- Subsets II
- Subsets II
- Subsets II
- Subsets II
- Subsets II
- 洛谷 P3605 [USACO17JAN]Promotion Counting晋升者计数——树状数组,权值线段树
- 关于Ajax 请求数据格式FormData、Ruquest PayLoad、Query String Parameters 区别
- ElasticSearchDSL查询模板之二(二重聚合)
- Android中TrafficStats流量监控类
- 第四章 /proc/ 文件系统
- Subsets II (contains duplicates)
- CNN浅析和历年ImageNet冠军模型解析
- Microsoft SQL Server for Linux安装和配置
- 淘淘商城系列——Redis持久化方案
- 38. Count and Say
- 设有一组N个数,求其中第K个最大者
- 《算法分析与设计》Week 12
- CTF-浅尝64位栈溢出PWN
- Git笔记