Medium 39题 Combination Sum

Question：

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

Solution:

public class Solution {
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        Arrays.sort(candidates);
        List<List<Integer>> res=new ArrayList<List<Integer>>();
        f(res,new ArrayList<Integer>(),candidates, target,0);
        
        return res;
    }
    public void f(List<List<Integer>> res, List<Integer> tmp, int[] candidates, int target, int start)
    {
        int i=0;
        if(target>0)
        {
            for(i=start;(i<=candidates.length-1)&&(target>=candidates[i]);i++)
            {
                tmp.add(candidates[i]);
                f(res,tmp,candidates,target-candidates[i],i);
                tmp.remove(tmp.size()-1);
            }
        }
        else if(target==0)
            res.add(new ArrayList<Integer>(tmp)); //i dont't understand....
    }
}