Java学习之求最大公约数与最小公倍数案例

案例代码：

import java. util.Scanner;
public class GCDLCM{
/*求最大公约数(Greatest Common Divisor)
*若x> y,gcd(x, y) = gcd(x - y, y)
*若x<y,gcd(x, y) = gcd(x, y- x)
*若x= y,god(x, y) = x = y*/
public static int gcd(int x , int y){
	if(x > y)
		return gcd(x - y, y);
	if(x < y)
		return gcd(x, y - x);
	return x;
}
/*求最小公倍数(Least Common Multiple)
*最小公倍数等于两数之积除以最大公约数*/
public static int lcm(int x, int y){
	int gcd = gcd(x, y);
	return x * y / gcd;				//求最大公约数
	}
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		System.out.print("请输人正整数×:"); 
		int a =sc.nextInt();
		System.out.print("请输入正整数y:");
		int b = sc.nextInt();
		System.out.println("最大公约数=" + gcd(a, b));
		System.out.println("最小公倍数=" + lcm(a, b));
	}
}

案例效果图：