LeetCode 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 :
  

问题分析

• 该问题相当于 LeetCode 77. Combinations 和 LeetCode 40. Combination Sum II 的结合，该题是找到固定的k个数等于n的情况，所以要用减法思想的话，需要两个参数都要同时减到0，才能将该路径加入res中。

代码实现

class Solution {
    public List<List<Integer>> combinationSum3(int k, int n) {
        if(n <= 0 || k <= 0 || k > n) {
            return new ArrayList<>();
        }
        List<List<Integer>> res = new ArrayList<>();
        findcombinationSum(k, n, 1, new ArrayList<>(), res);
        return res;
    }

    public void findcombinationSum(int count, int remain, int begin, ArrayList<Integer> path, List<List<Integer>> res) {
        // base case
        if (begin == 10 || count == 0) {
            if (count == 0 && remain == 0) {
                res.add(new ArrayList<>(path));
            }
            return;
        }
        for (int num = begin; count <= 9 - num + 1; ++num) { //注意count <= 9 - num + 1 ，也是一种剪枝
            //剪枝
            if (remain - num < 0) {
                break;
            }
            path.add(num);
            findcombinationSum(count - 1, remain - num, num + 1, path, res);
            path.remove(path.size() - 1);
        }
        return;
    }
}