欧几里得算法以及扩展算法

public class EuclidExtend {
public int gcd(int a ,int b)
{
int temp=0;
//System.out.println("start:");
if(b!=0){
int i=1;
for(i=1;a-b*i>=0;i++)
{ ; }
temp=b;
b=a-b*(i-1);
a=temp;
//System.out.println("next step:"+a+","+b);

return gcd(a,b);
}
else{
System.out.println("最大公约数：" +a);
return a;
}

}

public void compute(int num1,int num2)
{
int Q,A3,B3,T1,T2,T3,A1=1,A2=0,B1=0,B2=1;
A3=num1;
B3=num2;
if(gcd(A3,B3)==1){
System.out.println(num1+"和"+num2+"有逆元！");
do{
if(B3==0){
A3=gcd(A3, B3);
System.out.println("no inverse.");
}
else if(B3==1){
B3=gcd(A3, B3);
if(B2<0)
{
B2=B2+num1;
}
System.out.println("逆元："+B2);
break;
}

Q=(int)Math.floor(A3/B3);
T1=A1-Q*B1;
T2=A2-Q*B2;
T3=A3-Q*B3;

A1=B1;
A2=B2;
A3=B3;

B1=T1;
B2=T2;
B3=T3;
}while(true);
}
else{
System.out.println(num1+"和"+num2+"无逆元");
}

}
public static void main(String args[]){
int num1=1759,num2=550;
EuclidExtend ee=new EuclidExtend();
ee.compute(num1, num2);
}

}