LeetCode----- 39. Combination Sum

Given 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 CombinationSum {
	
	public static void main(String[] args) {
		CombinationSum cc = new CombinationSum();
		int[] candidates = new int[]{2, 3, 6, 7};
		System.out.println(cc.combinationSum(candidates, 7));
	}
	
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
    	List<List<Integer>> mList = new ArrayList<List<Integer>>();
    	
    	if(candidates.length < 0) {
    		return mList;
    	}
    	Arrays.sort(candidates);
    	dfs(0,candidates,target,mList,new ArrayList<Integer>());
    	return mList;
    }

	private void dfs(int start, int[] candidates, int target,
			List<List<Integer>> mList, ArrayList<Integer> list) {
		if(target < 0) {
			return;
		}
		if(target == 0) {
			mList.add(new ArrayList<Integer>(list));
			return;
		}
		for (int i = start; i < candidates.length; i++) {
			list.add(candidates[i]);
			dfs(i, candidates, target-candidates[i],mList, list);
			list.remove(list.size()-1);
		}
		
	}

}