LeetCode-subsets-ii

最新推荐文章于 2021-07-24 23:27:51 发布

六月二十七

最新推荐文章于 2021-07-24 23:27:51 发布

阅读量135

点赞数

分类专栏： LeetCode 文章标签： subsets-ii LeetCode

本文链接：https://blog.csdn.net/weixin_42146769/article/details/89036414

版权

LeetCode 专栏收录该内容

105 篇文章 0 订阅

订阅专栏

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

import java.util.ArrayList;
import java.util.ArrayList;
import java.util.Arrays;
 
public class Solution {
    public ArrayList<ArrayList<Integer>> subsetsWithDup(int[] num) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(num.length == 0){
            return result;
        }
        Arrays.sort(num);
        help(result,num,new ArrayList<Integer>(),0);
        return result;
    }
 
    private void help(ArrayList<ArrayList<Integer>> result, int[] num, ArrayList<Integer> list, int start) {
        result.add(new ArrayList<>(list));
        for(int i = start ; i < num.length ; i++){
            if( i != start && num[i] == num[i-1]){
                continue;
            }
            list.add(num[i]);
            help(result,num,list,i+1);
            list.remove(list.size()-1);
        }
    }
}