Java最大公约数和最小公倍数的求法（辗转相除法）

这道题计算了三个数的最小公倍数

import java.util.Scanner;

public class D {
    public static int gcd(int a,int b) {
        int max = a>b?a:b;
        int min = a<b?a:b;
        if(max%min != 0) {
            return gcd(min,max%min);
        }
        else
            return min;
    }
    public static int lcm(int a,int b) {
        return a*b/gcd(a,b);
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int a,b,c;
        Scanner in = new Scanner(System.in);
        a = in.nextInt();
        b = in.nextInt();
        c = in.nextInt();
        int d = lcm(a,b);
        d = lcm(d,c);
        System.out.println(d);
        return;
    }