【LeetCode】 039. Combination Sum

Given a set of candidate numbers (C) (without duplicates) 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.
• 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]
]

public class Solution {
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        helper(res, new ArrayList<Integer>(), candidates, 0, target);
        return res;
    }
    
    private void helper(List<List<Integer>> res, List<Integer> subList, int[] candidates, int start, int target) {
        if (target < 0) {
            return;
        }
        if (target == 0) {
            res.add(new ArrayList<Integer>(subList));
            return;
        }
        for (int i = start; i < candidates.length; i++) {
            subList.add(candidates[i]);
            helper(res, subList, candidates, i, target - candidates[i]);
            subList.remove(subList.size() - 1);
        }
    }
}