LeetCode22回溯01

第77题. 组合

力扣题目链接

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

    public List<List<Integer>> combine(int n, int k) {
        backTracking(n,k,1);
        return res;
    }
    public void backTracking(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);
            backTracking(n,k,i + 1);
            path.remove(path.size() - 1);
        }

    }
}