标签：style color io os java ar for div art
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 start,int k)
{
List<List<Integer>> result=new LinkedList<List<Integer>>();
if(k==0)
{
result.add(new LinkedList<Integer>());
return result;
}
for(;start<=n-k+1;start++)
{
List<List<Integer>> p=combine(n,start+1,k-1);
for(List<Integer> element:p)
{
element.add(0,start);
result.add(element);
}
}
return result;
}
public List<List<Integer>> combine(int n, int k) {
List<List<Integer>> result=combine(n,1,k);
return result;
}
}标签：style color io os java ar for div art
原文地址：http://blog.csdn.net/jiewuyou/article/details/39394237
