【Leetcode】39. Combination Sum

题目：

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeated number may be chosen from candidates unlimited number of times.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example 1:

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
[7],
[2,2,3]
]

思路：
这道题先把数组排序，然后new一个两层的res arraylist
然后写一个回溯算法，里面用到贪心算法
条件是 traget必须大于nums[i]，i<nums.length
因为可以重复，就一个一个往里面加

Code：

public List<List<Integer>> combinationSum(int[] candidates, int target) {
   List<List<Integer>> res = new ArrayList<List<Integer>>();
   Arrays.sort(candidates); 
    comBin(candidates, target, res, new ArrayList<Integer>(), 0);
    
    return res;
}
public void comBin(int[]nums,int target,List<List<Integer>> res,ArrayList<Integer> list,int start ){
    if(target<0) return;
    if(target==0) res.add(list);
    
    for(int i = start;i<nums.length&&target>=nums[i];i++){
        list.add(nums[i]);
        comBin(nums,target-nums[i],res,new ArrayList<Integer>(list), i);
        list.remove(list.size() - 1);

    }
    
}