【LeetCode】Combination Sum && Combination Sum II

1、Combination Sum
Total Accepted: 8525 Total Submissions: 32594 My Submissions
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
The same repeated number may be chosen from C unlimited number of times.
Note:
All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.
For example, given candidate set 2,3,6,7 and target 7, 
A solution set is: 
[7] 
[2, 2, 3] 
解题思路:
从数组的初始元素开始寻找累加和，每个元素可以使用多次，就意味着每次递归的时候，都可以从初始元素开始。

Java AC

public class Solution {
    private int len = 0;
    public ArrayList<ArrayList<Integer>> combinationSum(int[] candidates, int target) {
        ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
        if(candidates == null || candidates.length == 0){
            return list;
        }
        len = candidates.length;
        ArrayList<Integer> numList = new ArrayList<Integer>();
        dfs(list, numList, candidates, 0, 0, target);
        return list;
    }
    public void dfs(ArrayList<ArrayList<Integer>> list, ArrayList<Integer> numList,
                int[] candidates, int start, int sum, int target){
        if(sum == target){
            ArrayList<Integer> tempList = new ArrayList<Integer>(numList);
        	Collections.sort(tempList);
            list.add(tempList);
            return;
        }
        for(int i = start; i < len; i++){
            int tempSum = sum + candidates[i];
            if(tempSum <= target){
                numList.add(candidates[i]);
                dfs(list, numList, candidates, i, tempSum, target);
                numList.remove(numList.size()-1);
            }
        }
    }
}

2、Combination Sum II

Total Accepted: 6588 Total Submissions: 27883 My Submissions
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.
For example, given candidate set 10,1,2,7,6,1,5 and target 8, 
A solution set is: 
[1, 7] 
[1, 2, 5] 
[2, 6] 
[1, 1, 6]
解题思路:
这个比1限制严格一点，就是数据只能使用一次，那么每次递归，从下一个开始即可。
注意有可能得出重复情况，所以需要处理重复数据。基本思想，是对初始数据排序，然后用list记录在当前循环中是否使用过。

Java AC

public class Solution {
    private int len = 0;
    public ArrayList<ArrayList<Integer>> combinationSum2(int[] candidates, int target) {
        ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
        if(candidates == null || candidates.length == 0){
            return list;
        }
        Arrays.sort(candidates);
        len = candidates.length;
        ArrayList<Integer> numList = new ArrayList<Integer>();
        dfs(list, numList, candidates, 0, 0, target);
        return list;
    }
    public void dfs(ArrayList<ArrayList<Integer>> list, ArrayList<Integer> numList,
                int[] candidates, int start, int sum, int target){
        if(sum == target){
        	ArrayList<Integer> tempList = new ArrayList<Integer>(numList);
        	Collections.sort(tempList);
            list.add(tempList);
            return;
        }
        ArrayList<Integer> reList = new ArrayList<Integer>();
        for(int i = start; i < len; i++){
            int tempSum = sum + candidates[i];
            if(tempSum <= target){
            	if (!reList.contains(candidates[i])) {
					reList.add(candidates[i]);
				}else {
					continue;
				}
                numList.add(candidates[i]);
                dfs(list, numList, candidates, i+1, tempSum, target);
                numList.remove(numList.size()-1);
            }
        }
    }
}