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], ]
Similar to subset. Use recursion in iteration.
public class Solution {
public ArrayList<ArrayList<Integer>> combine(int n, int k) {
ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
if (n == 0 || k == 0) {
return res;
}
ArrayList<Integer> item = new ArrayList<Integer>();
helper(res, item, n, k, 1);
return res;
}
private void helper(ArrayList<ArrayList<Integer>> res, ArrayList<Integer> item, int n, int k, int start) {
if (item.size() == k) {
res.add(new ArrayList<Integer>(item));
return;
}
for (int i = start; i <= n; i++) {
item.add(i);
helper(res, item, n, k, i + 1);
item.remove(item.size() - 1);
}
}
}