day25

最新推荐文章于 2024-05-20 20:08:58 发布

看你呀

最新推荐文章于 2024-05-20 20:08:58 发布

阅读量52

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/YYYSSSFFFF/article/details/134300739

版权

216. 组合总和 III

与组合类似，终止条件多了相加之和的判断

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

    void backtracking(int k, int n, int startIndex, int sum) {
        if (path.size() == k && sum == n) {
            result.add(new ArrayList<>(path));
            return;
        }
        for (int i = startIndex; i <= 9 ; i++) {
            sum += i;
            path.add(i);
            backtracking(k, n, i + 1, sum);
            sum -= i;
            path.removeLast();
        }
    }
}

17. 电话号码的字母组合

创建一个数组用来存储每个数组对应的字符串，index代表递归的深度，for循环前先用数组下标减去0即可得到对应数组的字符串。

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