代码随想录day22：回溯part2，组合总和

day22：回溯part2，组合总和

216.组合总和 III

class Solution {
    List<List<Integer>> ans = new ArrayList<>();
    List<Integer> path = new LinkedList<>();
    public List<List<Integer>> combinationSum3(int k, int n) {
        backtracking(k, n, 1, 0);
        return ans;
    }
    public void backtracking(int k, int targetSum, int startIndex, int sum) {
        if (sum > targetSum) return;
        if (path.size() == k) {
            if (sum == targetSum)
                ans.add(new ArrayList<>(path));
            return;
        }
        for (int i = startIndex; i <= 9 - (k - path.size()) + 1; i++) {
            sum += i;
            path.add(i);
            backtracking(k, targetSum, i + 1, sum);
            sum -= i;
            path.removeLast();
        }
    }
}

17.电话号码的字母组合

class Solution {
    List<String> ans = new ArrayList<>();
    StringBuilder sb = new StringBuilder();
    public List<String> letterCombinations(String digits) {
        if (digits.length() == 0) return ans;
        String[] numWithStr = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        backtracking(digits, numWithStr, 0);
        return ans;
    }
    public void backtracking(String digits, String[] numWithStr, int idx) {
        if (idx == digits.length()) {
            ans.add(sb.toString());
            return;
        }
        String str = numWithStr[digits.charAt(idx) - '0'];
        for (int i = 0; i < str.length(); i++) {
            sb.append(str.charAt(i));
            backtracking(digits, numWithStr, idx + 1);
            sb.deleteCharAt(sb.length() - 1);
        }
    }
}