【LeetCode】#40组合总和II(Combination Sum II)

【LeetCode】#40组合总和II(Combination Sum II)

题目描述

给定一个数组 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。
candidates 中的每个数字在每个组合中只能使用一次。
说明：
所有数字（包括目标数）都是正整数。
解集不能包含重复的组合。

示例

示例 1:

输入: candidates = [10,1,2,7,6,1,5], target = 8,
所求解集为:
[
[1, 7],
[1, 2, 5],
[2, 6],
[1, 1, 6]
]

示例 2:

输入: candidates = [2,5,2,1,2], target = 5,
所求解集为:
[
[1,2,2],
[5]
]

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

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

解法

class Solution {
    
    List<List<Integer>> res = new ArrayList<>();
    
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        Arrays.sort(candidates);
        int length = candidates.length;
        for(int i=0; i<length; i++){
            if(i>0 && candidates[i]==candidates[i-1])
                continue;
            if(candidates[i]==target)
                res.add(Arrays.asList(candidates[i]));
            else{
                List<Integer> tmp = new ArrayList<>();
                tmp.add(candidates[i]);
                combinationSum2(candidates, target-candidates[i], i+1, tmp);
            }
                
        }
        return res;
    }
    
    public void combinationSum2(int[] candidates, int target, int startAt, List<Integer> currentList){
        for(int i=startAt; i<candidates.length; i++){
            if(candidates[i]==target){
                currentList.add(candidates[i]);
                res.add(currentList);
                return;
            }
            if(candidates[i]>target){
                return;
            }
            if(candidates[i]<target){
                List<Integer> tmp = new ArrayList<>(currentList);
                tmp.add(candidates[i]);
                combinationSum2(candidates, target-candidates[i], i+1, tmp);
            }
            while(i<candidates.length-1 && candidates[i]==candidates[i+1]){
                i++;
            }
        }
    }
}