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

组合总和III

力扣链接
文档讲解
视频讲解

答案

class Solution {
    List<List<Integer>> result = new ArrayList<>();
    LinkedList<Integer> path = new LinkedList<>();

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

    private void backTracking(int target, int k, int start, int sum){
        if (sum > target) return;
        
        if (path.size() == k){
            if (sum == target){
                result.add(new ArrayList<>(path));
                return;
            }
        }
        
        for (int i = start; i <= 9 -(k - path.size()) + 1; i++){
            path.add(i);
            sum += i;
            backTracking(target, k, i + 1, sum);
            path.removeLast();
            sum -= i;
        }
    }
}

电话号码的字母组合

力扣链接
文档讲解
视频讲解

答案

class Solution {
    List<String> list = new ArrayList<>();

    public List<String> letterCombinations(String digits) {
        if (digits == null || digits.length() == 0) {
            return list;
        }
        String[] numStr = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        backTracking(digits, numStr, 0);
        return list;
    }
    
    StringBuilder sb = new StringBuilder();
    
    private void backTracking(String digit, String[] numStr, int num){
        if (num == digit.length()){
            list.add(sb.toString());
            return;
        }
        String str = numStr[digit.charAt(num) - '0'];
        for (int i = 0; i < str.length(); i++){
            sb.append(str.charAt(i));
            backTracking(digit, numStr, num + 1);
            sb.deleteCharAt(sb.length() - 1);
        }
    }
}