ユークリッドの互除法のJavaプログラムを2種類紹介

public class EuclidAlgorithm {
    public static int findGCD(int num1, int num2) {
        // num2が0になるまで繰り返す
        while (num2 != 0) {
            int temp = num2;
            num2 = num1 % num2;
            num1 = temp;
        }
        return num1;
    }

    public static void main(String[] args) {
        int num1 = 60;
        int num2 = 24;
        int gcd = findGCD(num1, num2);
        System.out.println("最大公約数：" + gcd);
    }
}

package experiments;

public class SubtractionEuclidAlgorithm {
    public static int findGCD(int num1, int num2) {
        while (num1 != num2) {
            if (num1 > num2) {
                num1 = num1 - num2;
            } else {
                num2 = num2 - num1;
            }
        }
        return num1;
    }

    public static void main(String[] args) {
        int num1 = 60;
        int num2 = 24;
        int gcd = findGCD(num1, num2);
        System.out.println("最大公約数：" + gcd);
    }
}