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], ]
Have you met this question in a real interview?
思路: 很简单的题, 用dfs 直接解决。
public class Solution {
public List<List<Integer>> combine(int n, int k) {
List<List<Integer>> ret = new ArrayList<List<Integer>>();
if(n < 1 || k < 1)
return ret;
List<Integer> sol = new ArrayList<Integer>();
dfs(n, k, 1, sol, ret);
return ret;
}
private void dfs(int n , int k, int start, List<Integer> sol, List<List<Integer>> ret){
if(sol.size() == k){
ret.add(new ArrayList<Integer>(sol));
return;
}
for(int i = start; i <= n ; i++){
sol.add(i);
dfs(n, k, i + 1, sol, ret);
sol.remove(sol.size() - 1);
}
}
}