combination

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) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        List<Integer> solution = new ArrayList<Integer>();
        helper(result,solution,n,k,1);
        return result;
    }
    public void helper(
        List<List<Integer>> result,
        List<Integer> solution,
        int n,
        int k,
        int start){
            if(solution.size() == k){
                //ArrayList的构造方法：public ArrayList(Collection<? extends E> c)
                //这里必须是这样add，如果是result.add(solution),则只有一个实例对象，
                //当跳出循环到solution.remove(solution.size()-1)时，solution将变成[],
                //这是result里面的solution也会变成[]
                result.add(new ArrayList(solution));
                return;
            }
            for(int i = start; i <= n; i++){
                solution.add(i);
                helper(result,solution,n,k,i+1);
                solution.remove(solution.size()-1);
            }
        }
}