组给出两个整数n和k,返回从1......n中选出的k个数的组合。
例如 n = 4 且 k = 2
返回的解为:
[[2,4],[3,4],[2,3],[1,2],[1,3],[1,4]]
public class Solution {
public List<List<Integer>> combine(int n,int k){
List<List<Integer>> lists = new ArrayList<List<Integer>>();
List<Integer> list = new ArrayList<Integer>();
help(lists,list,n,k,1);
return lists;
}
public void help(List<List<Integer>> lists , List<Integer> list,int n,int k,int sta){
if(list.size() == k){
lists.add(new ArrayList(list));
return;
}
//!!!循环
for(int i=sta;i<=n;i++){
list.add(i);
help(lists,list,n,k,i+1);
list.remove(list.size()-1);
}
}
}