Subsets II

最新推荐文章于 2022-05-07 14:28:24 发布

mogusuntou

最新推荐文章于 2022-05-07 14:28:24 发布

阅读量217

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/mogusuntou/article/details/58283638

算法专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种算法，用于从可能包含重复数字的整数列表中找出所有可能的子集组合。通过深度优先搜索（DFS）并利用排序和跳过重复元素的方法来避免生成重复的子集。

Given a list of numbers that may has duplicate numbers, return all possible subsets

class Solution {
    /**
     * @param nums: A set of numbers.
     * @return: A list of lists. All valid subsets.
     */
    public ArrayList<ArrayList<Integer>> subsetsWithDup(int[] nums) {
        ArrayList<ArrayList<Integer>> results = new ArrayList<ArrayList<Integer>>();
        if (nums == null || nums.length == 0) {
            return results;
        }
        ArrayList<Integer> subset = new ArrayList<>();
        Arrays.sort(nums);
        dfsHelp(nums, 0, subset, results);
        return results;
    }
    private void dfsHelp(int[] nums,
                         int index,
                         ArrayList<Integer> subset,
                         ArrayList<ArrayList<Integer>> results) {
        results.add(new ArrayList<Integer>(subset));
        for (int i = index; i < nums.length; i++) {
            if (i != index && nums[i] == nums[i - 1]) {
                continue;
            }
            subset.add(nums[i]);
            dfsHelp(nums, i + 1, subset, results);
            subset.remove(subset.size() - 1);
        }
    }    
}