[LeetCode] Combinations 组合项
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
For example,
If n = 4 and k = 2, a solution is:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]
这道题让求1到n共n个数字里k个数的组合数的所有情况,还是要用深度优先搜索DFS来解,根据以往的经验,像这种要求出所有结果的集合,一般都是用DFS调用递归来解。那么我们建立一个保存最终结果的大集合res,还要定义一个保存每一个组合的小集合out,每次放一个数到out里,如果out里数个数到了k个,则把out保存到最终结果中,否则在下一层中继续调用递归。
class Solution {
public List<List<Integer>> combine(int n, int k) {
List<List<Integer>> combines = new ArrayList<>();
List<Integer> combineList = new ArrayList<>();
help(combines, combineList, 1, n ,k);
return combines;
}
private void help(List<List<Integer>> combines, List<Integer> combineList,
int start, int n, int k){
if(k == 0){
combines.add(new ArrayList<>(combineList));
return;
}
for(int i = start; i <= n - k + 1; i++){
combineList.add(i);
help(combines, combineList, i + 1, n ,k - 1);
combineList.remove(combineList.size() - 1);
}
}
}
第二次自己写
class Solution {
public List<List<Integer>> combine(int n, int k) {
List<Integer> list = new ArrayList<>();
List<List<Integer>> result = new ArrayList<>();
help(1, n, k, list, result);
return result;
}
private void help(int start, int n, int k, List<Integer> list, List<List<Integer>> result){
if(list.size() == k){
result.add(new ArrayList(list));
}
for(int i = start; i <= n; i++){
list.add(i);
help(i + 1, n, k, list, result);
list.remove(list.size() - 1);
}
}
}