一、递归问题
1、从a个球中取b个球,求取法
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int a=sc.nextInt(),b=sc.nextInt();
int an=find(a,b);
System.out.println(an);
}
public static int find(int a,int b){
if(a<b) return 0;
if(a==b) return 1;
if(b==0) return 1;
return find(a-1, b-1)+find(a-1, b);
}
}
2、n个元素全排列
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
char[] a=s.toCharArray();
find(a, 0);
}
public static void find(char[] a,int k){
if(k==a.length){
for(int i=0;i<a.length;i++){
System.out.print(a[i]+" ");
}
System.out.println();
}
for(int i=k;i<a.length;i++){
char t=a[k];a[k]=a[i];a[i]=t;
find(a, k+1);
t=a[k];a[k]=a[i];a[i]=t;
}
}
}
3、abc的反转串
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
String sc="abc";
System.out.println(find(sc));
}
public static String find(String s){
if(s==null||s.length()<2) return s;
return s.substring(1) +s.charAt(0);
}
}
4、杨辉三角第m层第n个元素
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scanner=new Scanner(System.in);
int m=scanner.nextInt();
int n=scanner.nextInt();
System.out.println(find(m,n));
}
public static int find(int m,int n){
if(m==0) return 1;
if(m==n) return 1;
return find(m-1, n)+find(m-1,n-1);
}
}
5、m个A,n个B能组合多少个不同排列
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scanner=new Scanner(System.in);
int m=scanner.nextInt();
int n=scanner.nextInt();
System.out.println(find(m,n));
}
public static int find(int m,int n){
if(m==0||n==0) return 1;
return find(m-1, n)+find(m,n-1);
}
}