[20-04-26][Self-test 5]Java LCM & GCD

 1 package test_1_5;
 2 
 3 import java.util.Scanner;
 4 
 5 public class LCM_GCD {
 6 
 7     public static void main(String[] args) {
 8 
 9         /** 输入两个正整数m和n，求其最大公约数和最小公倍数。 */
10         Scanner sc = new Scanner(System.in);
11         System.out.println("请输入一个正整数：");
12         int num1 = sc.nextInt();
13         System.out.println("请输入另一个正整数：");
14         int num2 = sc.nextInt();
15 
16         getGCD(num1, num2);
17         getLCM(num1, num2);
18         
19     }
20 
21     /** 获取最大公约数 */
22     private static void getGCD(int num1, int num2) {
23 
24         int minNum = num1 > num2 ? num2 : num1;
25         int res = 1;
26         for (int i = 1; i <= minNum; i++) {
27             if (num1 % i == 0 && num2 % i == 0) {
28                 res = i;
29             }
30         }
31 
32         System.out.println("最大公约数是" + res);
33 
34     }
35 
36     /** 获取最小公倍数 */
37     private static void getLCM(int num1, int num2) {
38 
39         int max = num1 * num2;
40         int minNum = num1 > num2 ? num2 : num1;
41         int res = 1;
42         for (int i = minNum; i <= max; i++) {
43             if (i % num1 == 0 && i % num2 == 0) {
44                 res = i;
45                 break;
46             }
47         }
48 
49         System.out.println("最小公倍数是" + res);
50 
51     }
52 
53 }