java最大公约数程序找错误

求两个数的最大公约数 我是按照老师要求用递归写的..

然后运行,不出来.只有注解那里提示错误,其他地方都没有.看不出来那里有问题

谢谢啦

import java.io.*;
public class Gcd{ //Eclipse提示说public gcd要定义在自己文件内？
int find_gcd(int m,int n){
if(m<0 ||n <0)
{
return find_gcd(Math.abs(m),Math.abs(n));
}else{
if(m<n)
return find_gcd(n,m);
if(n==0)
return m;
else
return find_gcd(m-n,n);
}
}
}
public class Q8{

public static void main(String[] args)throws IOException {
// TODO Auto-generated method stub
BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
System.out.print("Please input two numbers ");
int first = Integer.parseInt(br.readLine());
int second = Integer.parseInt(br.readLine());
Gcd test =new Gcd();
test.find_gcd(first,second);


}
}

import java.io.*;

class Gcd{ //Eclipse提示说public gcd要定义在自己文件内？一个文件只能有一个public类
int find_gcd(int m,int n){
if(m<0 ||n <0)
{
return find_gcd(Math.abs(m),Math.abs(n));
}else{
if(m<n)
return find_gcd(n,m);
if(n==0)
return m;
else
return find_gcd(n,m%n);
}
}
}
public class Q8{


public static void main(String[] args)throws IOException {
// TODO Auto-generated method stub
BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
System.out.print("Please input two numbers:\n");
int first = Integer.parseInt(br.readLine());
int second = Integer.parseInt(br.readLine());
Gcd test =new Gcd();
System.out.println("最大公约数是:" + test.find_gcd(first,second));
}
}

import java.io.*; public class Gcd{ //Eclipse提示说public gcd要定义在自己文件内？ // 应该为 不要public 因为在同一个文件里面只能有一个public 修饰的类，所以只要含有main方法的类用public 修饰就行了！ int find_gcd(int m,int n){ if(m<0 ||n <0) { return find_gcd(Math.abs(m),Math.abs(n)); }else{ if(m<n) return find_gcd(n,m); if(n==0) return m; else return find_gcd(m-n,n); } } } public class Q8{

public static void main(String[] args)throws IOException { // TODO Auto-generated method stub BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.print("Please input two numbers "); int first = Integer.parseInt(br.readLine()); int second = Integer.parseInt(br.readLine()); Gcd test =new Gcd(); test.find_gcd(first,second); } }