Java求最大公约数和最小公倍数

int n, m = n = 0;
System.out.println("输入整数m,n");
Scanner scanner = new Scanner(System.in);
if (scanner.hasNextInt()) {
    m = scanner.nextInt();
}

if (scanner.hasNextInt()) {
    n = scanner.nextInt();
}

System.out.println(String.format("m=%d, n=%d", m, n));
int d = m * n;
if(m < n) {　//确保(m > n) 
    int temp = n;
    n = m;
    m = temp;
}

for (int i = m % n; i != 0; i = m % n) { //寻找能够共同除尽的数
    m = n;
    n = i;
}
//最大公约数　＝　共同除尽的最大数，　最小公倍数　＝　两数相乘／最大公约数
System.out.println(String.format("最大公约数=%d, 最小公倍数=%d", n, d / n));