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], ]
采用回溯法,先选择出现在第一个位置上的数字,再选择出现在第二个位置上的数字,列举出全部可能的情况
public class Solution {
public List<List<Integer>> combine(int n, int k) {
if (k > n || k == 0) return null;
List<List<Integer>> res = new ArrayList<List<Integer>>();
List<Integer> cur = new ArrayList<Integer>();
List<Integer> num = new ArrayList<Integer>();
for(int i = 1;i <= n;i++) num.add(i);
rec(res,num,cur,k,1);
return res;
}
private void rec(List<List<Integer>> res,List<Integer> num,List<Integer> cur, int k,int level) {
if (level > k) {
res.add(new ArrayList(cur));
return;
}
else {
for (; num.size() > k-level ;) {
cur.add(num.get(0));
List<Integer> t = new ArrayList<Integer>(num);
t.remove(0);
rec(res,t,cur,k,level+1);
cur.remove(cur.size() - 1);
num.remove(0);
}
}
}
}