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], ]DFS+recursion
使用一个int变量l代表当前的level,然后每次recursion的时候另l=i+1,即从当前变量的下一个开始枚举。当list.size大于k的时候,将list加入result
因为Java的引用传递,每次recusion前需要克隆一个当前的list,否则在recusion中改变list的时候,recusion前的list也会变化。
代码:
public class Solution {
public List<List<Integer>> combine(int n, int k) {
List<List<Integer>> result=new ArrayList<List<Integer>>();
ArrayList<Integer> level=new ArrayList<Integer>();
if(n<k){
return result;
}
else{
getCombine(n,k,1,result,level);//Recusion from level 1(1-n)
}
return result;
}
public void getCombine(int n, int k, int l, List<List<Integer>>result, ArrayList<Integer> level){
if(level.size()==k){
result.add(level);//when list size is k, add to result list
return;
}
else{
for(int i=l;i<=n;i++){
ArrayList<Integer> newLevel=(ArrayList)level.clone();//Clone a new list from current list
newLevel.add(i);
getCombine(n,k,i+1,result,newLevel);//recusion from level i+1 (current is i)
}
}
}
}