LeetCode 77. Combinations

最新推荐文章于 2024-10-07 07:09:00 发布

USC_ECE

最新推荐文章于 2024-10-07 07:09:00 发布

阅读量75

点赞数

分类专栏： Depth First Search 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_31361913/article/details/107118926

版权

Depth First Search 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

https://leetcode-cn.com/problems/combinations/solution/hui-su-suan-fa-jian-zhi-python-dai-ma-java-dai-ma-/

class Solution {
    public List<List<Integer>> combine(int n, int k) {
        List<List<Integer>> res = new ArrayList<>();
        backtrack(n, k, 1, new ArrayList<>(), res);
        return res;
    }
    private void backtrack(int n, int k, int start, List<Integer> path, List<List<Integer>> res){
        if(path.size() == k){
            res.add(new ArrayList<>(path));
            return;
        }
        for(int i = start; i <= n - (k - path.size()) + 1; i++){
            path.add(i);
            backtrack(n, k, i + 1, path, res);
            path.remove(path.size() - 1);
        }
    }
}