代码随想录算法训练营day24 77.组合

题目链接77.组合

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