递归练习---求两个数的最大公约数（方式二）

public class MaxCommDivTest {
private static int[] arr = new int[2];
public static void main(String[] args) {
createRandom();
System.out.println(arr[0]+"-->"+arr[1]);
MaxCommDiv(arr[0], arr[1]);
}
public static void MaxCommDiv(int a,int b){
int result = recMaxCommDiv(a, b);
if(result != 1){
System.out.println("the value of MaxCommonDivisor is  ： " + result);
}else{
System.out.println("not exists MaxCommonDivisor");
}
}
public static int recMaxCommDiv(int a, int b){
if(b==0){
return a;
}else{
return recMaxCommDiv(b, a%b);
}
}
public static void createRandom(){
for(int i=0;i<2;i++){
arr[i]=(int)(Math.random()*100+2);
}
}

}