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


class Solution {
List<List<Integer>> res = new ArrayList<>();
public List<List<Integer>> combine(int n, int k) {
ArrayList<Integer> tmp = new ArrayList<Integer>();
combineCore(n,k,tmp,1);
return res;
}
public void combineCore(int n, int k, ArrayList<Integer> tmp, int index){
if(tmp.size()==k){
ArrayList<Integer> temp = new ArrayList<Integer>(tmp);
res.add(temp);
}
for(int i=index; i<=n; i++){
tmp.add(i);
combineCore(n,k,tmp,i+1);
tmp.remove(tmp.size()-1);
}
}
}
还是老题目，全排列思想，一样的套路