JAVA组合算法.doc

文档介绍：JAVA组合算法
import .*;
public b {
public bine(int[] list,int k,int l,int r,int n){
if(k+l>n+1)
return;
if(l==0){
for(int i=0;i<R;I++)< P>
(list[i]+" ");
();
return;
}
list[r-l]=k;
combine(list,k+1,l-1,r,n);
if(k+l<=n)
combine(list,k+1,l,r,n);
}
public static void main(String []args) throws NumberFormatException, IOException{
Comb obj = b();
BufferedReader br = new BufferedReader(new InputStreamReader());
("Please input n: ");
int n = (());
("Please input r: ");
int r = (());
int []list = new int[r];
int k=1;
int l=r;
bine(list,k,l,r,n);
}
}