Leetcode——40. Combination Sum II【dfs重要】

题目原址

https://leetcode.com/problems/combination-sum-ii/description/

题目描述

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

解题思路

因为数组中的同一个数不能被使用两次，所以首先要对数组进行排序，调用Arrays类的sort()方法进行排序。然后使用dfs对数组中的元素进行查找，因为这里还存在一个重复的问题，即排序后的数变为{1，2，2}想要找目标是3的集合，那么应该返回的是一个{1，2}，而不是两个{1，2}，所以这里需要将重复出现的元素跳过去，这里采用的是while循环的方式，将相同的元素忽略。但是该while语句应该放在每次循环的最后一句话。

AC代码

class Solution {
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        Arrays.sort(candidates);
        List<List<Integer>> list = new ArrayList<List<Integer>>();
        List<Integer> l = new ArrayList<Integer>();
        dfs(list, l, 0, candidates, target);
        return list;
    }

    public void dfs(List<List<Integer>> list, List<Integer> l, int start, int[] candidates, int target) {
        if(target < 0)
            return;
        if(target == 0){
            list.add(new ArrayList<Integer>(l));
            return;
        }

        for(int i = start; i < candidates.length; i++) {
            l.add(candidates[i]);
            dfs(list, l, i + 1, candidates, target - candidates[i]);
            l.remove(l.size() - 1);
            while(i < candidates.length - 1 && candidates[i] == candidates[i + 1])
                i++;
        }
    }
}

参考

https://www.jianshu.com/p/b3a5c60d26c7