【LeetCode】【JAVA】【065】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] 

思路：

使用recursion 进行DFS 就可以得出结果

Code：

    ArrayList<List<Integer>> al;
    ArrayList<Integer> sub;
    int[] c;
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        al = new ArrayList<List<Integer>>();
        if(candidates.length == 0) return al;
        sub = new ArrayList<Integer>();
        c = candidates;
        Arrays.sort(c);
        recursion(target,0);
        return al;
    }
    public void recursion(int result, int start){
        if(result < 0) return;
        if(result == 0){
            al.add(new ArrayList<Integer>(sub));
            return;
        }
        for(int i=start; i<c.length;i++){
            sub.add(c[i]);
            recursion(result-c[i],i);
            sub.remove(sub.size()-1);
        }
    }

备注：

Recursion 时可以不用向自身传递 ArrayList 而直接使用一个 ArrayList

Recursion 还是不熟练

有 non-descending order 时要对数组先进行排列