java求最大公约是和最小公倍数

import java.util.Scanner;

public class 最大公约最小公倍数 {
public static void main(String[] args) {

System.out.println("请输入两个整数，用空格分开");
Scanner inputNum = new Scanner(System.in);
int m = inputNum.nextInt();
int n = inputNum.nextInt();
int gongYueShu = gongYue(m, n);
System.out.println("最大公约数是：" + gongYueShu);
System.out.println("最小公倍数是：" + gongYueShu*(m/gongYueShu)*(n/gongYueShu));
}

public static int gongYue(int m, int n) {
while(true) {
if((m = m%n) == 0) {
return n;
}
if((n = n%m) == 0) {
return m;
}
}
}
}