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

]

package leetCode;

import java.util.ArrayList;
import java.util.List;

/**
 * Created by lxw, liwei4939@126.com on 2018/3/11.
 */
public class L077_Combinations {

    public List<List<Integer>> combine(int n, int k){
        List<List<Integer>> combs = new ArrayList<>();
        combine(combs, new ArrayList<Integer>(), 1, n, k);
        return combs;
    }

    private void combine(List<List<Integer>> combs, List<Integer> comb,
                         int start, int n, int k){
        if (k == 0){
            combs.add(new ArrayList<>(comb));
        }
        for (int i = start; i<= n; i++){
            comb.add(i);
            combine(combs, comb, i+1, n, k-1);
            comb.remove(comb.size() - 1);
        }
    }
}