تولید زیر مجموعه های منحصر به فرد و یافتن مبالغ زیر مجموعه در جاوا

import java.util.*;

public class UniqueSubsets {
    public static List<List<Integer>> subsetsWithDup(int[] nums) {
        List<List<Integer>> result = new ArrayList<>();
        Arrays.sort(nums); // Sort to handle duplicates
        backtrack(result, new ArrayList<>(), nums, 0);
        return result;
    }

    private static void backtrack(List<List<Integer>> result, List<Integer> tempList, int[] nums, int start) {
        result.add(new ArrayList<>(tempList));
        for (int i = start; i < nums.length; i++) {
            if (i > start && nums[i] == nums[i - 1]) continue; // Skip duplicates
            tempList.add(nums[i]);
            backtrack(result, tempList, nums, i + 1);
            tempList.remove(tempList.size() - 1);
        }
    }
}

Input: [1, 2, 2]
Output: [[], [1], [1, 2], [1, 2, 2], [2], [2, 2]]

public static List<List<Integer>> subsetSum(int[] nums, int target) {
    List<List<Integer>> result = new ArrayList<>();
    Arrays.sort(nums); // Sort to handle duplicates
    backtrackSum(result, new ArrayList<>(), nums, target, 0, 0);
    return result;
}

private static void backtrackSum(List<List<Integer>> result, List<Integer> tempList, int[] nums, int target, int sum, int start) {
    if (sum == target) {
        result.add(new ArrayList<>(tempList));
        return;
    }
    for (int i = start; i < nums.length; i++) {
        if (i > start && nums[i] == nums[i - 1]) continue; // Skip duplicates
        if (sum + nums[i] > target) break; // Prune the recursion
        tempList.add(nums[i]);
        backtrackSum(result, tempList, nums, target, sum + nums[i], i + 1);
        tempList.remove(tempList.size() - 1);
    }
}

Input: [1, 2, 2, 3, 5], Target Sum = 5
Output: [[2, 3], [5]]

public static List<List<Integer>> combinationSum2(int[] candidates, int target) {
    List<List<Integer>> result = new ArrayList<>();
    Arrays.sort(candidates);
    backtrackCombination(result, new ArrayList<>(), candidates, target, 0);
    return result;
}

private static void backtrackCombination(List<List<Integer>> result, List<Integer> tempList, int[] candidates, int target, int start) {
    if (target == 0) {
        result.add(new ArrayList<>(tempList));
        return;
    }
    for (int i = start; i < candidates.length; i++) {
        if (i > start && candidates[i] == candidates[i - 1]) continue; // Skip duplicates
        if (candidates[i] > target) break;
        tempList.add(candidates[i]);
        backtrackCombination(result, tempList, candidates, target - candidates[i], i + 1);
        tempList.remove(tempList.size() - 1);
    }
}

Input: [10, 1, 2, 7, 6, 1, 5], Target Sum = 8
Output: [[1, 1, 6], [1, 2, 5], [1, 7], [2, 6]]