HOMEWORK06 最大公约数与最小公倍数（辗除法）

public class work06_02 {
 public static void main(String[] args) {
  Scanner sc = new Scanner(System.in);
  System.out.println("请输入第一个数字：");
  int number1 = sc.nextInt();
  System.out.println("请输入第二个数字：");
  int number2 = sc.nextInt();
  int max = maxGys(number1,number2);
  System.out.println("最大公约数为："+max);
  System.out.println("最小公倍数为："+number1*number2/max);
 }
 public static int maxGys(int number1 , int number2){
 //判断number1与number2的大小
  if(number1<number2){
   int k = number1;
   number1 = number2;
   number2 = k;
  }
  if(number1%number2 ==0){
   return number2;
  }else{
   return maxGys(number2,number1%number2);
  }
 }
}

注意最小公倍数与最大公约数之间的关系