代码随想录训练营第三十五期|第25天|回溯算法part02|● 216.组合总和III● 17.电话号码的字母组合

216. 组合总和 III - 力扣（LeetCode）

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

    private void backtracking(List<List<Integer>> res, List<Integer> list, int k, int n, int idx, int sum) {
        if (sum > n) return;
        if (list.size() == k) {
            if (sum == n) {
                res.add(new ArrayList<>(list));
            }
        }

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

17. 电话号码的字母组合 - 力扣（LeetCode）

class Solution {
    String[] keyPad = new String[]{"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
    public List<String> letterCombinations(String digits) {
        List<String> res = new ArrayList<>();
        if (digits == null || digits.length() == 0) return res;
        StringBuilder sb = new StringBuilder();
        backtracking(res, sb, digits, 0);
        return res;
    }

    private void backtracking(List<String> res, StringBuilder sb, String digits, int idx) {
        if (idx == digits.length()) {
            res.add(sb.toString());
            return;
        }

        String str = keyPad[digits.charAt(idx) - '0'];
        for (int i = 0; i < str.length(); i++) {
            sb.append(str.charAt(i));
            backtracking(res, sb, digits, idx + 1);
            sb.deleteCharAt(sb.length() - 1);
        }
    }
}