代码随想录算法训练营day25 216.组合总数||| 17.电话号码的字母组合

最新推荐文章于 2024-06-15 23:36:03 发布

二木三金l

最新推荐文章于 2024-06-15 23:36:03 发布

阅读量27

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/m0_74100262/article/details/131490364

版权

题目链接216.组合总数

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

题目链接17.电话号码的字母组合

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