辗转相除法求最大公约数

直接上模板

import java.util.Scanner;

public class day11 {
     
	public static void main(String args[]) {
     
		int a ;
		int b;
		Scanner sc = new Scanner(System.in);
		a = sc.nextInt();
		b = sc.nextInt();
		System.out.println("这两个数的最大公约数是："+gcd(a , b));
	}

	private static int  gcd(int a, int b) {
     
		// TODO Auto-generated method stub
		return b!=0? gcd(b,a%b):a;
	}
}