用Java展示GCD的整个过程

import java.util.Scanner;

public class GCDExample {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        
        System.out.print("请输入第一个整数：");
        int num1 = scanner.nextInt();
        
        System.out.print("请输入第二个整数：");
        int num2 = scanner.nextInt();
        
        int gcd = findGCD(num1, num2);
        
        System.out.println("最大公约数是：" + gcd);
    }
    
    // 使用辗转相除法求最大公约数
    public static int findGCD(int num1, int num2) {
        while (num2 != 0) {
            int temp = num1 % num2;
            num1 = num2;
            num2 = temp;
        }
        return num1;
    }
}