package com.xxx.xxxx.template.service;
import java.util.Scanner;
/**
* 测试类TiGuiTest
*/
public class TiGuiTest {
static int row;
public static void main(String args[]){
System.out.print("Please input n:");//这里n取8
Scanner scan1=new Scanner(System.in);
int n=scan1.nextInt();
System.out.print("Please input r:");//这里r取5
Scanner scan2=new Scanner(System.in);
int r=scan2.nextInt();
int[] list=new int[n];
for(int i=0;i
list[i]=n-i;
}
combination(list,r,0,n);
}
/**
* 递归函数
*/
static void combination(int[] list,int r,int low,int n){
if(low
for(int j=low;j
if((low>0&&list[j]
int temp=list[low];
list[low]=list[j];
list[j]=temp;
combination(list,r,low+1,n);
temp=list[low];
list[low]=list[j];
list[j]=temp;
}
}
}
if(low==r){
for(int i=0;i
System.out.print(list[i]+" ");
}
System.out.println(" ");
}
}
}
分享到:
2016-03-24 18:30
浏览 1286
评论
1 楼
columbia7311
2017-03-28
楼主有没有自己运行过,结果错了吧