三天一题-33-Combination SumII(回溯思想)

题目地址: Combination Sum II
描述:
Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
Each number in candidates may only be used once in the combination.
Note:
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example 1:
Input: candidates = [10,1,2,7,6,1,5], target = 8,
A solution set is:
[
[1, 7],
[1, 2, 5],
[2, 6],
[1, 1, 6]
]
Example 2:
Input: candidates = [2,5,2,1,2], target = 5,
A solution set is:
[
[1,2,2],
[5]
]
大致意思:给你一个数组(都是正数)和目标数,找出加一起等于目标数的所有的组合,要求这些组合不能重复。

import java.util.*;

public class CombinationSumII {

    public static ArrayList<ArrayList<Integer>> combinationSumII(int[] candidates, int target) {
        ArrayList<Integer> list = new ArrayList<>();
        ArrayList<ArrayList<Integer>> res = new ArrayList<>();
        Arrays.sort(candidates);
        backTracking(candidates, target, list, res, 0);
        return res;
    }
    //1122456
    private static void backTracking(int[] candidates, int target, ArrayList<Integer> list,
                                     ArrayList<ArrayList<Integer>> res, int count) {
        if( target <= 0){
            return;
        }
        int length = candidates.length;
        for (int i = count; i < length; i++) {
            //过滤相同元素,此处之所以加上i>count一方面防止i=0报错,另一方面是防止过滤掉类似于1124,116这种有相等值的元素,如果不理解可以去掉跑一遍。
            if (i > count && candidates[i]==candidates[i-1]) continue;
            list.add(candidates[i]);
            backTracking(candidates, target - candidates[i], list, res, i+1);
            if (target == candidates[i]) {
                res.add(new ArrayList<>(list));
            }
            list.remove(list.size() - 1);
        }
    }

    public static void main(String[] args) {
        int[] candidates = {1, 6, 2, 5, 3,1,2,4};
        Arrays.sort(candidates);
        ArrayList<ArrayList<Integer>> arrayLists = combinationSumII(candidates, 8);
        System.out.println(arrayLists);
    }

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值