leetcode------Combination Sum

标题：	Combination Sum
通过率：	27.7%
难度：	中等

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] 

本题依然是递归算法，算法的关键点是递归时重复元素。题目上说可以从candidate中重复一个元素，那么再递归时不用从i+1开始，还是从i开始，结果还可能是重复的情况，那么还是要res。cantain一次，具体细节看代码：

public class Solution {
    public ArrayList<ArrayList<Integer>> combinationSum(int[] candidates, int target) {
        ArrayList<ArrayList<Integer>> res=new ArrayList<ArrayList<Integer>>();
        ArrayList<Integer> tmp=new ArrayList<Integer>();
        Arrays.sort(candidates);
        dfs(candidates,target,0,res,tmp);
        return res;
    }
    public void dfs(int[] candidates, int target,int start,ArrayList<ArrayList<Integer>> res,ArrayList<Integer> tmp){
        if(target<0)return;
        if(target==0 && !res.contains(tmp)){
            res.add(new ArrayList<Integer>(tmp));
            return ;
        }
        for(int i=start;i<candidates.length;i++){
            tmp.add(candidates[i]);
            dfs(candidates,target-candidates[i],i,res,tmp);
            tmp.remove(tmp.size()-1);
        }
    }
}