求两个数的最大公约数和最小公倍数（3种算法）

程序：
import java.util.Scanner;
import java.util.regex.Pattern;

public class number {
    public  int num1;
    public  int num2;
    public  int num3;

    //辗转相除法求最大公因数
    public int div() {
        int a, b, c;
        a = num1;
        b = num2;
        while (a % b != 0) {
            c = a%b;
            a = b;
            b = c;
        }
        return b;
    }

    //辗转相减法求最大公因数
    public int sub() {
        int a, b;
        a = num1;
        b = num2;
        while (a != b) {
            if (a > b) {