项目介绍:编写计算“两个整数的最大公约数”程序
代码:
import java.util.*;
public class gongyue {
public static int biggestgongyue(int a,int b){
if(a>b){//保持a<b
int temp=a;
a=b;
b=temp;
}
if(b%a==0)return a;
else return biggestgongyue(a,b%a);
}
public static void main(String args[]){
int m;
int n;
Scanner scan=new Scanner(System.in);
System.out.print("请输入一个数m:");
m=scan.nextInt();
System.out.print("请输入另一个数n:");
n=scan.nextInt();
System.out.println("m和n的最大公约数为:");
System.out.println(biggestgongyue(m,n));
}
}
代码:
import java.util.*;
public class gongyue {
public static int biggestgongyue(int a,int b){
if(a>b){//保持a<b
int temp=a;
a=b;
b=temp;
}
if(b%a==0)return a;
else return biggestgongyue(a,b%a);
}
public static void main(String args[]){
int m;
int n;
Scanner scan=new Scanner(System.in);
System.out.print("请输入一个数m:");
m=scan.nextInt();
System.out.print("请输入另一个数n:");
n=scan.nextInt();
System.out.println("m和n的最大公约数为:");
System.out.println(biggestgongyue(m,n));
}
}
演示结果: