递归解决欧几里德公约数算法

Friedrich Hsing

于 2021-07-19 21:49:01 发布

阅读量149

点赞数 1

本文链接：https://blog.youkuaiyun.com/weixin_51282350/article/details/118915200

版权

import java.util.Scanner;
public class TestA
{
    public static void main(String[] arg)
    {
        Scanner input = new Scanner(System.in);
        int num1 = input.nextInt();
        int num2 = input.nextInt();
        gcd(num1,num2);
        input.close();
    }
    public static void gcd(int num1, int num2)
    {
        if(num2<=num1&&num1%num2==0)
        {
            System.out.println("递归结束，答案:"+num2);
        }
        else if(num1<num2)
        {
            gcd(num2,num1);
        }
        else
        {
            gcd(num2,num1%num2);
        }
    }
}