Day 24 | 77. Combinations

最新推荐文章于 2024-11-04 12:20:00 发布

王锴KKKKKKyle

最新推荐文章于 2024-11-04 12:20:00 发布

阅读量329

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/kyle313606922/article/details/128572676

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

该文是作者在LeetCode上进行算法练习的日程记录，涉及多种数据结构和算法，如二叉树遍历、回溯法求解组合问题等。文章通过具体题目详细解释了如何使用回溯法解决组合问题，包括终止条件、递归过程及路径回溯等关键步骤。

摘要由CSDN通过智能技术生成

Backtracing

Three points of backtracing

Determine the parameters and return value
Determine the terminal condition
Traversal process of backtracing

LeetCode 77. Combinations

Question Link

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

    public List<List<Integer>> combine(int n, int k) {
        backtracking(1, n, k);
        return result;
    }

    void backtracking(int startIndex, int n, int k){
        // termination condition
        if(path.size() == k){
            result.add(new ArrayList<>(path));  // collect result
            return;
        }
        // select the elements in this layer
        for(int i = startIndex; i <= n - (k - path.size()) + 1; i++){
            path.add(i);                // handle node
            backtracking(i+1, n, k);    // recursion
            path.remove(path.size()-1); // backtracking
        }
    }
}

The number of nodes found: path.size()
The number of nodes to find: k - path.size()
The minimum length of [x, n] should be k - path.size() for continued searching. We can get equation n - x + 1 = k - path.size()
Solve the equation to get x = n - (k - path.size()) + 1 .