蓝桥杯练习系统算法训练——最小公倍数

求最小公倍数

import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		int m = s.nextInt();
		int k = 0;
		
		System.out.println(n*m/getMaxCommonDivisor(n, m));
	}
	
	public static int getMaxCommonDivisor(int a,int b) {
		int temp =  0;
		if (a < b) {
			temp = a;
			a = b;
			b = temp;
		}
		
		int mod = a%b;
		
		
		if (mod == 0) {
			return b;
		} else {
			return getMaxCommonDivisor(b,mod);
		}
	}
}