Combination Sum III

题目描述：
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.

Ensure that numbers within the set are sorted in ascending order.

Example 1:

Input: k = 3, n = 7

Output:

[[1,2,4]]

Example 2:

Input: k = 3, n = 9

Output:

[[1,2,6], [1,3,5], [2,3,4]]

这个题用回溯法，稍微有点不同的是这里的k是不确定的，代码如下：

public List<List<Integer>> combinationSum3(int k, int n) {
    List<List<Integer>> result =new ArrayList<List<Integer>>();
    List<Integer> list=new ArrayList<Integer>();
    rec(result, list, k, n, 0, 1);
    return result;
}

public void rec(List<List<Integer>> result,List<Integer> list,int k,int n,int sum,int start){
    if(k==0&&sum==n){
        result.add(new ArrayList<Integer>(list));
        return ;
    }
    if((k==0&&sum!=k)||start==10){
        return ;
    }
    for(int i=start;i<=9;i++) {
        List<Integer> newList=new ArrayList<Integer>(list);
        newList.add(i);
        rec(result, newList, k-1, n, sum+i, i+1);
    }
}