Leetcode 39. Combination Sum (Medium) (java)

Leetcode 39. Combination Sum (Medium) (java)

Tag: Array, Backtracking

Difficulty: Medium

/*

39. Combination Sum (Medium)

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.
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<>();
        Arrays.sort(candidates);
        combinationSum(candidates, target, 0, res, new ArrayList<>());
        return res;
    }
    private void combinationSum(int[] candidates, int target, int start, List<List<Integer>> res, List<Integer> res_sub) {
        if (start > candidates.length || target < 0) {
            return;
        } else if (target == 0) {
            res.add(new ArrayList(res_sub));
            return;
        }
        for (int i = start; i < candidates.length; i++) {
            res_sub.add(candidates[i]);
            combinationSum(candidates, target - candidates[i], i, res, res_sub);
            res_sub.remove(res_sub.size() - 1);
        }
    }
}