JAva最小公倍数及び最大公因数の求め方

import java.util.*;
public class Yanjiu3 {
    public static void main(String [] args){
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        int n = sc.nextInt();
        if(m<n)
        {
            int t=m;
            m=n;
            n=t;
        }
        int g=gongying(m,n);
        System.out.println("      ："+m*n/g);
    }
    public static int gongying(int a,int b){
        int c=a%b;//       
        while(c!=0)
        {
            a=b;
            b=c;
            c=a%b;
        }
        System.out.println("      ："+b);
        return b;
    }
}