39. 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] 

Subscribe to see which companies asked this question

public class Solution {
    private List<List<Integer>> ret = new ArrayList<> ();
    private int [] c;
    private int sum(List<Integer> a){
        int i = a.size();
        int ret = 0;
        for(int k = 0;k<i;k++){
            ret+=a.get(k);
        }
        return ret;
    }
    private void dfs(int target,int n,List<Integer> a){
        if(sum(a)==target){ret.add(new ArrayList<Integer>(a));return;}
        for(int i = n;i<c.length;i++){
            a.add(c[i]);
            if(sum(a)>target){
                a.remove(a.size()-1);
                break;
            }else{
                dfs(target,i,a);
                a.remove(a.size()-1);
                continue;
            }
        }
        return;
    }
    public List<List<Integer>> combinationSum(int[] can, int target) {
         Arrays.sort(can);
        c=can;
        List<Integer> a = new ArrayList<>();
        dfs(target,0,a);
        return ret;
    }
}