实现与理性类(Java)的可比接口



我是Java的初学者,这是我第一次使用可比接口。我不明白为什么在比较R1和R2时它会继续返回零。有人可以向我解释我的代码怎么了?谢谢。

public class Rational implements Comparable<Rational>{
private  int num; //numerator
private int denom; //denominator
public Rational() {
 num = 0;
 denom = 1;   
 } 
 public Rational(int num, int denom) {
 if(denom <=0 ){
     throw new ArithmeticException("You cannot divide by a non-positive  number");
 }
 this.num = num;
 this.denom = denom;
 } 
 //returns numerator of this rational number
 public int getNum() {
 return num;
 } 
 //returns denominator of this rational number
 public int getDenom() {
 return denom;
 } 
 public Rational add(Rational rhs) { 
 return new Rational(num*rhs.denom+rhs.num*denom, denom*rhs.denom); 
 } 
 public Rational subtract(Rational rhs) { 
 return new Rational(num*rhs.denom-rhs.num*denom, denom*rhs.denom); 
 } 
 public Rational multiply(Rational rhs) { 
 return new Rational(num*rhs.num, denom*rhs.denom); 
 } 
 public Rational divide(Rational rhs) { 
 return new Rational(num*rhs.denom, denom*rhs.num); 
 }  
 public String toString() {
 String result;
 if (num == 0)
 result = "0";
 else if(denom == 1)
 result = num + "";
 else
 result = num + "/" + denom;
 return result;
 }
 public int compareTo(Rational rhs){
 double r1 = ((double) getNum()/getDenom());
 double r2 =  ((double)rhs.getNum() / rhs.getDenom());
 return (int) (r1 - r2);
 }
public static void main(String[] args) {
     Rational r1 = new Rational(1, 2); // 1/2 
     Rational r2 = new Rational(3, 4); // 3/4  
     Rational result = r1.add(r2); 
     Rational result1 = r1.subtract(r2);
     Rational result2 = r1.multiply(r2);
     Rational result3 = r1.divide(r2);
     System.out.println( "r1 + r2 = " + result + "n" + "r1 - r2 = " +    result1 + "n" + "r1*r2 = "+ result2 + "n" + "r1/r2 = " + result3 + "n" + (r1.compareTo(r2)));                  
     }
}

此公式

return (int) (r1 - r2);

r1r2之间的差异小于1时,产生零,您正在测试。

由于两个分母都通过构建班级而呈阳性,因此您可以跨越和减去而无需使用划分:

long a = (long)getNum() * rhs.getDenom();
long b = (long)rhs.getNum() * getDenom();
return Long.compare(a, b);

使用long避免繁殖溢出。

相关内容

  • 没有找到相关文章

最新更新