LeetCode23回溯● 216.组合总和III● 17.电话号码的字母组合

216.组合总和III

力扣题目链接

class Solution {

    private List<List<Integer>> result = new ArrayList<>();
    private List<Integer> path = new ArrayList<>();

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

        if (sum > n)return;

        if(path.size() == k){
            if(sum == n)result.add(new ArrayList(path));
            else return;
        }

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

    }
}

去掉sum也可以

class Solution {

    private List<List<Integer>> result = new ArrayList<>();
    private List<Integer> path = new ArrayList<>();

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

        if (n < 0)return;

        if(path.size() == k){
            if(n == 0)result.add(new ArrayList(path));
            else return;
        }

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

    }
}

17.电话号码的字母组合

力扣题目链接

class Solution {
    private List<String> result = new ArrayList<>();
    private StringBuilder sb = new StringBuilder();
    private String[] alphabet = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};

    public List<String> letterCombinations(String digits) {
        if(digits.length() == 0)return result;
        

        backTracking(digits,0);
        return result;
        }
    
    public void backTracking(String digits,int index){
        if(index == digits.length()){
            result.add(sb.toString());
            return;
        }


        String str = alphabet[digits.charAt(index) - '0'];
        for(int i = 0 ; i < str.length();i++){
            sb.append(str.charAt(i));
            backTracking(digits,index + 1);
            sb.deleteCharAt(sb.length() - 1);
        }


    }
}