public class Solution {
public List<List<Integer>> combine(int n, int k) {
List<List<Integer>> list = new ArrayList<>();
if(n < k){
return list;
}
helper(list, new ArrayList<>(), n, k, 1);
return list;
}
private void helper(List<List<Integer>> list, List<Integer> temp, int n, int k, int start){
if(k == 0){
list.add(new ArrayList<>(temp));
return;
}
for(int i = start; i <=n; i++){
temp.add(i);
helper(list, temp, n, k - 1, i + 1);
temp.remove(temp.size() - 1);
}
}
}
[LeetCode] 77. Combinations
最新推荐文章于 2024-09-21 23:12:45 发布