Combinations,combination
Combinations,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 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; } }
permutations and combinations
排列组合 (数学上的问题)
hierarchy:等级制度,阶级 (‘哈也哎日啊可义)
Combinations:合并(考门比,类生s)
component:组成,部件(靠门,P欧能t)
miscellaneous:各种各样的,不同性质的(米死也,类你哎死)
评论暂时关闭