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] 

  private ArrayList<List<Integer>> lists = new ArrayList<List<Integer>>();

    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        if (candidates == null || candidates.length == 0)
            return lists;
        Arrays.sort(candidates);
        ArrayList<Integer> temp = new ArrayList<>();
        combines(0, temp, candidates, target, 0, lists);
        return lists;
    }

    //回溯法,start防止重复的，从start开始的数组所有的组合都遍了一遍，所以下一次可以排除start，从start+1往后组合；
    public void combines(int sum, ArrayList<Integer> list, int[] arr, int target, int start, ArrayList<List<Integer>> templists) {
        if (sum > target) {
            return;
        }
        if (sum == target) {
            templists.add((ArrayList<Integer>) list.clone());
        }

        for (int i = start; i < arr.length; i++) {
            list.add(arr[i]);
            combines(sum + arr[i], list, arr, target, i, templists);
            list.remove((Integer) arr[i]);
        }
    }