求两个数的最大公约数和最小公倍数

import java.util.Scanner;

public class Test {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println("输入两个正整数m和n：");
int m = input.nextInt();
int n = input.nextInt();
if (m < n) {
int temp = n;
n = m;
m = temp;
}
for (int i = n; i > 0; i--) {
if (m % i == 0 && n % i == 0) {
System.out.println("最大公约数为" + i);
break;
}
}

for (int max = m;; max++) {
if (max % m == 0 && max % n == 0) {
System.out.println("最小公倍数为" + max);
break;
}
}
}
}