77.组合

77.组合

题目描述

给定两个整数 n 和 k，返回 1 ... n 中所有可能的 k 个数的组合。

示例:

输入: n = 4, k = 2
输出:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],]

贴出代码

class Solution {
    public List<List<Integer>> combine(int n, int k) {
        List<List<Integer>> combinations = new ArrayList<>();
        List<Integer> combineList = new ArrayList<>();
        backtracking(combineList,combinations,1,k,n);
        return combinations;
    }

    private void backtracking(List<Integer> combineList, List<List<Integer>> combinations, int start, int k, final int n){
        if (k == 0){
            combinations.add(new ArrayList<>(combineList));
            return;
        }
        for (int i = start; i <= n - k + 1;i ++){
            combineList.add(i);
            backtracking(combineList,combinations,i + 1, k - 1,n);
            combineList.remove(combineList.size() - 1);
        }
    }
}

转载于:https://www.cnblogs.com/Tu9oh0st/p/11043615.html