求解两个数的最大公约数

利用枚举法

import java.util.Scanner;

public class Hello {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        int gcd = 1;
        for (int i = 2;i <= a && i <= b;i++ )
        {
            if(a % i == 0 && b % i == 0)
            {
                gcd = i;
            }
        }
        System.out.println(a+"和"+b+"最大公约数是"+gcd);
    }
}

 

利用辗转相除法

import java.util.Scanner;

public class Hello {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        int oa = a;
        int ob = b;
        int r;
        while(b != 0)
        {
            r = a % b;
            a = b;
            b = r;
        }
        System.out.println(oa+"和"+ob+"最大公约数是"+a);
    }
}