LeetCode.216. 组合总和 III

LeetCode.216. 组合总和 III

难度：medium

 

 回溯的简单应用，套用回溯的模板，进行剪枝操作，参考我的另一篇博客：(2条消息) LeetCode.77. 组合_Chamberlain T的博客-CSDN博客

Java：

class Solution {
    List<List<Integer>> result = new ArrayList<List<Integer>>();
    List<Integer> path = new ArrayList<>();
    int sum = 0;
    public List<List<Integer>> combinationSum3(int k, int n) {
        backtracking(k, n, 1);
        return result;
    }

    public void backtracking(int k, int n, int startIndex) {
        if (path.size() == k) {
            if (sum == n) {
                result.add(new ArrayList<>(path));
            }
            return;
        }

        for(int i = startIndex; i <= 9 - (k - path.size()) + 1; i++) {
            sum += i;
            path.add(i);
            backtracking(k, n, i + 1);
            sum -= i;
            path.remove(path.size() - 1);
        }
    }
}

剪枝：

class Solution {
    List<List<Integer>> result = new ArrayList<List<Integer>>();
    List<Integer> path = new ArrayList<Integer>();
    int sum = 0;

    public List<List<Integer>> combinationSum3(int k, int n) {
        backtracking(k, n, 1);
        return result;
    }

    
    public void backtracking(int k, int n, int startIndex) {
        if (sum > n) {
            return;
        }
        if (path.size() == k) {
            if (sum == n) {
                result.add(new ArrayList<>(path));
            }         
            return;
        } 

        for (int i = startIndex; i <= 9 - (k - path.size()) + 1; i++) {
            sum += i;
            path.add(i);
            backtracking(k, n, i + 1);
            sum -= i;
            path.remove(path.size() - 1);
        }

    }
}