经典算法-递归-最大公约数最小公倍数

求最大公约数及最大公倍数

import java.util.*;
public class Main {
 public static void main(String[] args) {
  Scanner sc = new Scanner(System.in);
  int num1 = sc.nextInt();
  int num2 = sc.nextInt();
  int max = maxy(num1,num2);
  int min = minb(num1,num2,max);
  System.out.println("它们最大公约数为:"+max);
  System.out.println("它们最小公倍数为:"+min);
 }
 private static int maxy(int num1, int num2) {
  if (num2==0) {
   return num1;
  }else{
   int y = num1%num2;
   return maxy(num2,y);
  }
 }
 private static int minb(int num1, int num2, int max) {
  return num1*num2/max;
 }
}