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

publicclassCommonDivisor{

  publicstaticvoidmain(String args[])

  {

    commonDivisor(24,32);

  }

  staticintcommonDivisor(intM,intN)

  {

    if(N<0||M<0)

    {

      System.out.println("ERROR!");

      return-1;

    }

    if(N==0)

    {

      System.out.println("the biggest common divisor is :"+M);

      returnM;

    }

    returncommonDivisor(N,M%N);

  }

}

importjava.util.Scanner;

publicclassCandC

{

  //下面的方法是求出最大公约数

  publicstaticintgcd(intm,intn)

  {

    while(true)

    {

      if((m = m % n) ==0)

        returnn;

      if((n = n % m) ==0)

        returnm;

    }

  }

  publicstaticvoidmain(String args[])throwsException

  {

    //取得输入值

    //Scanner chin = new Scanner(System.in);

    //int a = chin.nextInt(), b = chin.nextInt();

    inta=23;intb=32;

    intc = gcd(a, b);

    System.out.println("最小公倍数："+ a * b / c +"n最大公约数："+ c);

  }

}