77. 组合
文章讲解:代码随想录
class Solution {
List<List<Integer>> lists = new ArrayList<>();
public List<List<Integer>> combine(int n, int k) {
List<Integer> list = new ArrayList<>();
backTracking(list,n,k,1);
return lists;
}
public void backTracking(List<Integer> list,int n,int k,int start){
if(list.size() == k){
lists.add(new ArrayList<>(list));
return;
}
for(int i = start;i<=n;i++){
list.add(i);
backTracking(list,n,k,i+1);
list.remove(list.size()-1);
}
}
}