leetcode 216 Combination Sum II (回溯法)

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.

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

Credits:

Special thanks to @mithmatt for adding this problem and creating all test cases.

这道题也是回溯法求解。但是限制了list的大小，同时list的元素不能重复。所以更新index时候，至少应该+1,不能从原来的index增加。

public class Solution {
    public List<List<Integer>> combinationSum3(int k, int n) {
        List<List<Integer>> res = new ArrayList<>();
        List<Integer> recur = new ArrayList<Integer>();
        helper(res,recur,1,k,n);
        return res;
    }
    public void helper(List<List<Integer>> res,List<Integer> recur, int start,int k,int n ){
        if(recur.size()==k  && n==0){
            List<Integer> tmp = new ArrayList<Integer>(recur);
            res.add(tmp);
            return;
        }
        for(int i=start;i<=9;i++){
            recur.add(i);
            helper(res,recur,i+1,k,n-i);
            recur.remove(recur.size()-1);
        }
    }
}