public class Test {
public static void main(String[] args) {
//测试下
int zxgbs = zxgbs(32,112);
System.out.println(zxgbs);
int zdgys = zdgys(112,32);
System.out.println(zdgys);
}
//用递归方法求最小公倍数
public static int zxgbs(int x,int y){
if(x>=y){
if(x==y){
return x;
}else{
if(x%y==0){
return y;
}else{
return zxgbs(y,x%y);
}
}
}else{
//两数交换
x=x^y;
y=x^y;
x=x^y;
return zxgbs(x,y);
}
}
//调用最小公倍数的方法间接求得最大公约数
public static int zdgys(int x,int y){
int zdgys = (x/zxgbs(x, y))*(y/zxgbs(x, y))*zxgbs(x, y);
return zdgys;
}
}
用递归求最小公倍数的算法
最新推荐文章于 2022-03-22 20:52:59 发布