[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],
]

思路：

使用dfs。base case是当所添加的队列长度已经达到k的时候就返回。具体代码如下：

public List<List<Integer>> combine(int n, int k) {
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        if (n == 0 || k == 0 || n < k) {
            return res;
        }
        
        List<Integer> item = new ArrayList<Integer>();
        dfsHelper(n, k, res, item, 1);
        return res;
    }
    
    private void dfsHelper(int n, int k, List<List<Integer>> res, List<Integer> item, int start) {
        if (item.size() == k) {
            res.add(new ArrayList<Integer>(item));
            return;
        }
        for (int i = start; i <= n; i++) {
            item.add(i);
            dfsHelper(n, k, res, item, i + 1);
            item.remove(item.size() - 1);
        }
    }