LeetCode 39 && 40 : Combination Sum && Combination Sum II

39 题目描述

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeated number may be chosen from candidates unlimited number of times.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example 1:

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
[7],
[2,2,3]
]
Example 2:

Input: candidates = [2,3,5], target = 8,
A solution set is:
[
[2,2,2,2],
[2,3,3],
[3,5]
]

java实现

  class Solution {
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        List<List<Integer>> result=new ArrayList<>();
        if(candidates==null || candidates.length==0)
            return result;
        backtrace(candidates,  target, 0, result,new ArrayList<Integer>());
        return result;
    }
    private void backtrace(int[] candidates, int remain, int start, List<List<Integer>> result,ArrayList<Integer> temp){
        if(remain<0)
            return;
        if(remain==0 && !result.contains(temp)){
            result.add(new ArrayList<>(temp));
            return;
        }
        for (int i = start; i <candidates.length ; i++) {
            temp.add(candidates[i]);
            backtrace(candidates,  remain-candidates[i], i, result,temp);
            temp.remove(temp.size()-1);
        }
    }
}

40 题目描述

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

java实现

    class Solution {
        public List<List<Integer>> combinationSum2(int[] nums, int target) {
            List<List<Integer>> list = new ArrayList<>();
            Arrays.sort(nums);
            backtrack(list, new ArrayList<>(), nums, target, 0);
            return list;
        }
    
        private void backtrack(List<List<Integer>> list, List<Integer> tempList, int [] nums, int remain, int start){
            if(remain < 0) 
                return;
            else 
                if(remain == 0 && !list.contains(tempList) ){
                    list.add(new ArrayList<>(tempList));
                    return;
                }
            else{ 
                for(int i = start; i < nums.length; i++){
                    tempList.add(nums[i]);
                    // i + 1 because we can not reuse same elements
                    backtrack(list, tempList, nums, remain - nums[i], i+1); 
                    tempList.remove(tempList.size() - 1);
                }
            }
        }
    }

总结

两个题目类似，39题目允许元素重复（从当前元素开始），40题目不允许元素重复（从下一个元素开始）