进行最大公约数和最小公倍数的求解

public class 最大公约数最小公倍数 {//进行最大公约数的计算public static int greatestCommonDivisor(int max,int min){if(max<min){int temp=max;max=min;min=max;}int yushu=max%min;while(yushu!=0){if(yushu>min){max=yushu;}else{max=min;min=yushu;}yushu=max%min;}return min;}
//	进行最小公倍数的求解，最小公倍数=两数之积除以其最大公约数public static int minimumCommonMultiple(int max,int min){int theGreatestCommonDivisor=greatestCommonDivisor(max,min);int theMinimumCommonMultiple=max*min/theGreatestCommonDivisor;return theMinimumCommonMultiple;}public static void main(String[] args) {// TODO Auto-generated method stubScanner scanner=new Scanner(System.in);System.out.println("请输入第一个数字a:");int a=scanner.nextInt();System.out.println("请输入第二个数字b:");int b=scanner.nextInt();System.out.println("a="+a+",b="+b);int theGreatestCommonDivisor=greatestCommonDivisor(a, b);System.out.println("最大公约数为:"+theGreatestCommonDivisor);int theMinimumCommonMultiple=minimumCommonMultiple(a, b);System.out.println("最小公倍数为:"+theMinimumCommonMultiple);}}