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

给定一个数组candidates和一个数字target，找出这个数组中数字之和等于给定数字的集合

1.先将数组排序，如果给定的数字（target）小于数组中最小的元素那么不存在复合要求的集合

2.将给定的target依次减去candidates数组中由小到大的数值，并寻找减去后的数组集合；

3.当不符合条件时将list中的最后一个元素删掉 从i+1开始找

public class Solution {
 public List<List<Integer>> combinationSum(int[] candidates, int target) {
    Arrays.sort(candidates);
    List<List<Integer>> result=new ArrayList<List<Integer>>();
    
    getResult(result,new ArrayList<Integer>(),candidates,target,0);
    return result;
    }
    
    private void getResult(List<List<Integer>> result, List<Integer> cur, int candidates[], int target, int start){
        if(target>0){
            for(int i=start;i<candidates.length&&candidates[i]<=target;i++){
                cur.add(candidates[i]);
                getResult(result,cur,candidates,target-candidates[i],i);
                cur.remove(cur.size()-1);  //递归到本次的时候不符合要求 直接执行到*行，再执行上次本行的remove命令 删除元素
            }
        }
        else if (target==0){
            result.add(new ArrayList<Integer>(cur));
        }//*
        
    }
}