蓝桥杯 算法训练 5-1最小公倍数

import java.util.Scanner;
public class Main {

    static int result = 1;

    public static boolean panduanHuZhi(int a,int b) {
        if(a > b) {
            int temp = a;
            a = b;
            b = temp;
        }
        for(int i = 2;i < a;i++) {
            if(a % i == 0 && b % i == 0) {
                return false;
            }
        }
        return true;
    }

    public static int duanchu(int a,int b) {
        if(panduanHuZhi(a,b) == true) {//两个质数的最小公倍数是两数乘积
            return result * a * b;
        }
        for(int i = 2;i < a;i ++) {
            if(a % i == 0 && b % i == 0) {
//              System.out.println("heloo"+i);
                result *= i * duanchu(a / i,b / i);;
            }
        }
        return result;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        System.out.println(duanchu(a,b));
    }
}