【LeetCode】 74子集 II

最新推荐文章于 2024-07-14 14:55:48 发布

JaneRoad

最新推荐文章于 2024-07-14 14:55:48 发布

阅读量90

点赞数

文章标签： leetcode 动态规划 gpu dfs unix

本文链接：https://blog.csdn.net/ChrisLu777/article/details/108901659

版权

题目：

解题思路：

动态规划

回溯法

https://leetcode-cn.com/problems/subsets-ii/solution/xiang-xi-tong-su-de-si-lu-fen-xi-duo-jie-fa-by-19/

代码：

package com.janeroad;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * Created on 2020/10/1.
 *
 * [@author](https://my.oschina.net/arthor) LJN
 */
public class Test51 {
    public static List<List<Integer>> subsetsWithDup(int[] nums) {
        List<List<Integer>> ans = new ArrayList<>();
        Arrays.sort(nums);
        getAns(nums, 0, new ArrayList<>(), ans);
        return ans;
    }

    private static void getAns(int[] nums, int start, ArrayList<Integer> temp, List<List<Integer>> ans) {
        ans.add(new ArrayList<>(temp));
        for (int i = start; i < nums.length; i++) {
            //和上个数字相等就跳过
            if (i > start && nums[i] == nums[i - 1]) {
                continue;
            }
            temp.add(nums[i]);
            getAns(nums, i + 1, temp, ans);
            temp.remove(temp.size() - 1);
        }
    }

    public static void main(String[] args) {
        int[] nums = new int[]{1,2,2};
        for (int i = 0; i < subsetsWithDup(nums).size(); i++) {
            System.out.println(subsetsWithDup(nums).get(i));
        }
    }
}