Combination Sum

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] 

Show Tags

思路 ： 用DFS 进行递归添加。 最终找到满足条件的组合。

易错点： 要确定 i = start,  每次进行下一层DFS 时候 i + 1; 

public class Solution {
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        List<List<Integer>> ret = new ArrayList<List<Integer>>();
        Arrays.sort(candidates);
        List<Integer> sol = new ArrayList<Integer>();
        dfs(candidates, 0, 0, target, sol, ret);
        return ret;
    }
    
    private void dfs(int[] nums, int start, int sum, int target, List<Integer> sol,  List<List<Integer>> ret){
        if(sum == target){
            ret.add(new ArrayList<Integer>(sol));
            return;
        }else if(sum > target){
            return;
        }
        for(int i = start; i < nums.length; i++){
            sol.add(nums[i]);
            dfs(nums, i, sum + nums[i], target, sol, ret);
            sol.remove(sol.size() - 1);
        }
    }
}