LeetCode刷题【Array】 Combination Sum

题目：

iven a set of candidate numbers (C) (without duplicates) 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]
]

解决方法：

public class Solution {
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
			List<List<Integer>> result = new ArrayList<>();
			backTrack(candidates,0,target,new ArrayList<>(),result);
			return result;
		}
	
	private void backTrack(int[] candidates, int start, int target, List<Integer> ret, List<List<Integer>> result){
		if(target<0) return;
		else if(target==0) result.add(new ArrayList<>(ret));
		else{
		   for(int i=start;i<candidates.length;i++){
			   ret.add(candidates[i]);
			   backTrack(candidates,i,target-candidates[i],ret,result);
			   ret.remove(ret.size()-1);
		   }
		}
	}
}

参考：

【1】https://leetcode.com/