【Leetcode】216. Combination Sum III

216. 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.

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.

Subscribe to see which companies asked this question.

题目简述：

输入两个数字k和n，要求输出加和为n的K个1~9不重复元素组成的集合。

思路简述：

采用深度优先算法+ArrayList<>类，详情见代码。

代码：

public class Solution {
    List<List<Integer>> res = new ArrayList<>();
    public List<List<Integer>> combinationSum3(int k, int n) {
        List<Integer> aList = new ArrayList<Integer>();
        singleCombSum(k,n,1,aList);
        return res;
    }
    public void singleCombSum(int k,int n,int head,List<Integer> aList){
        if(k == 1){
            if(n>=head && n<=9){
                aList.add(n);
                res.add(new ArrayList(aList));
                aList.remove(aList.size()-1);
            }
        }else if(n>0){
            for(int j=head;j<=9;j++){
                aList.add(j);
                singleCombSum(k-1,n-j,j+1,aList);
                aList.remove(aList.size()-1);
            }
        }
    }
}

结果：