Java中有理数类Rational Number详解

这里的各个方法之间都有很紧密的联系,小伙伴们要耐心地来回推敲哦

/**
 * Created with IntelliJ IDEA.
 * Description: Hello,I would appreciate your comments~
 * User: 葛玉礼
 * Date: 2022-03-19
 * Destination:有理数之间的运算
 */
public class RationalNumber {
    private int numerator;//分子
    private int denominator;//分母
    public RationalNumber(int numer, int denom){
        if(denom == 0){
            denom = 1;
        }
        if(denom < 0){
            numer = numer * -1;
            denom = denom * -1;
        }
        numerator = numer;
        denominator = denom;
        reduce();//这个方法后面会写到
    }
//    构建函数,用来初始化
    public int getNumerator(){
        return numerator;
//    返回分子
    }
    public  int getDenominator(){
        return  denominator;
//    返回分母
    }
    public RationalNumber reciprocal(){
        return new RationalNumber(denominator,numerator);
//    这里返回值类型为本RationalNumber类返回值类型,分子分母位置调换,所以方法作用为返回倒数
    }
    public RationalNumber add(RationalNumber op2){
        int commonDenominator = denominator * op2.getDenominator();
        int numerator1 = numerator * op2.getDenominator();
        int numerator2 = op2.getNumerator() * denominator;
        int sum = numerator1 + numerator2;
        return new RationalNumber(sum,commonDenominator);
//    和作为分子,分母之积作为分母
    }
    public RationalNumber subtract(RationalNumber op2){
        int commonDenominator = denominator * op2.getDenominator();
        int numerator1 = numerator * op2.getDenominator();
        int numerator2 = op2.getNumerator() * denominator;
        int difference = numerator1 - numerator2;
        return new RationalNumber(difference,commonDenominator);
    }
//    以上为有理数的减法运算
    public RationalNumber multiply(RationalNumber op2){
        int numer = numerator * op2.getNumerator();
        int denom = denominator * op2.getDenominator();
        return new RationalNumber(numer,denom);
    }
//    以上为有理数的乘法运算
    public RationalNumber divide (RationalNumber op2){
        return multiply(op2.reciprocal());
//     有理数的除法,除一个数则是乘这个数的倒数
    }
    public boolean isLike(RationalNumber op2){
        return (numerator == op2.getNumerator()&&denominator == op2.getDenominator());
    }
//    确定此有理数是否等于作为参数传递的有理数,假设在两者都被化简过的情况下
    public String toString (){
        String result;
        if (numerator == 0){
            result = "0";
        }else if(denominator == 1){
            result = numerator +"";
        }else {
            result = numerator + "/" + denominator;
        }
        return result;
//     将有理数转化为字符串
    }
    private void reduce(){
        if(numerator != 0){
            int common = gcd(Math.abs(numerator),denominator);
            numerator = numerator / common;
            denominator = denominator / common;
        }
    }
//    重要的动作:化简,这里的gcd为返回最大公因数
    private int gcd(int num1, int num2){
        while (num1 != num2){
            if(num1>num2){
                num1 = num1 - num2;
            }else {
                num2 = num2 - num1;
            }
        }
        return num1;
    }
}

然后我们再来进行对它的一个测试

/**
 * Created with IntelliJ IDEA.
 * Description: Hello,I would appreciate your comments~
 * User: 葛玉礼
 * Date: 2022-03-19
 * Destination:这是一个利用有理数方法来解释依赖概念的类
 */
public class RationalTest {
//    我们进一步利用有理数的类中的方法来解释我们的概念
    public static void main(String[] args) {
        RationalNumber r1 = new RationalNumber(6,8);
        RationalNumber r2 = new RationalNumber(1,3);
        RationalNumber r3, r4, r5 ,r6, r7;
        System.out.println("First rational number:" + r1);
        System.out.println("Second rational number:" + r2);
        if(r1.isLike(r2)){
            System.out.println("r1 and r2 are equal.");
        }else {
            System.out.println("r1 and r2 are not equal.");
            r3 = r1.reciprocal();
            r4 = r1.add(r2);
            r5 = r1.subtract(r2);
            r6 = r1.multiply(r2);
            r7 = r1.divide(r2);
            System.out.println("r1 + r2 = " + r4);
            System.out.println("r1 - r2 = " + r5);
            System.out.println("r1 * r2 = " + r6);
            System.out.println("r1 / r2 = " + r7);
        }
    }
}

测试结果为

r1 and r2 are not equal.
r1 + r2 = 13/12
r1 - r2 = 5/12
r1 * r2 = 1/4
r1 / r2 = 9/4

  • 8
    点赞
  • 15
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
(Rational Numbers) Create a class called Rational for performing arithmetic with fractions. Write a program to test your class. Use integer variables to represent the private instance variables of the class the numerator and the denominator. Provide a constructor that enables an object of this class to be initialized when it is declared. The constructor should store the fraction in reduced form. The fraction 2/4 is equivalent to 1/2 and would be stored in the object as 1 in the numerator and 2 in the denominator. Provide a no-argument constructor with default values in case no initializers are provided. Provide public methods that perform each of the following operations: a. Add two Rational numbers: The result of the addition should be stored in reduced form. b. Subtract two Rational numbers: The result of the subtraction should be stored in reduced form. c. Multiply two Rational numbers: The result of the multiplication should be stored in reduced form. d. Divide two Rational numbers: The result of the division should be stored in reduced form. e. Print Rational numbers in the form a/b, where a is the numerator and b is the denominator. f. Print Rational numbers in floating-point format. (Consider providing formatting capabilities that enable the user of the class to specify the number of digits of precision to the right of the decimal point.) – 提示: – 有理数是有分子、分母以形式a/b表示的数,其a是分子,b是分母。例如,1/3,3/4,10/4。 – 有理数的分母不能为0,分子却可以为0。每个整数a等价于有理数a/1。有理数用于分数的精确计算。例如1/3=0.0000…,它不能使用数据型double或float的浮点格式精确表示出来,为了得到准确结果,必须使用有理数。 – Java提供了整数和浮点数的数据型,但是没有提供有理数型。 – 由于有理数与整数、浮点数有许多共同特征,并且Number是数字包装的根,因此,把有理数Rational定义为Number的一个子是比较合适的。由于有理数是可比较的,那么Rational也应该实现Comparable接口。+下页图描述了Rational已将其与Number和Comparable接口的关系。 –
下面是一个简单的实现RationalNumber的C++代码: ```c++ #include <iostream> using namespace std; class RationalNumber { private: int numerator; // 分子 int denominator; // 分母 public: RationalNumber() { numerator = 0; denominator = 1; } RationalNumber(int numerator, int denominator) { this->numerator = numerator; this->denominator = denominator; simplify(); // 约分 } // 获取分子 int getNumerator() const { return numerator; } // 获取分母 int getDenominator() const { return denominator; } // 赋值运算符重载 RationalNumber& operator=(const RationalNumber& other) { if (this != &other) { numerator = other.numerator; denominator = other.denominator; } return *this; } // 加法运算符重载 RationalNumber operator+(const RationalNumber& other) { int newNumerator = numerator * other.denominator + other.numerator * denominator; int newDenominator = denominator * other.denominator; return RationalNumber(newNumerator, newDenominator); } // 减法运算符重载 RationalNumber operator-(const RationalNumber& other) { int newNumerator = numerator * other.denominator - other.numerator * denominator; int newDenominator = denominator * other.denominator; return RationalNumber(newNumerator, newDenominator); } // 乘法运算符重载 RationalNumber operator*(const RationalNumber& other) { int newNumerator = numerator * other.numerator; int newDenominator = denominator * other.denominator; return RationalNumber(newNumerator, newDenominator); } // 除法运算符重载 RationalNumber operator/(const RationalNumber& other) { int newNumerator = numerator * other.denominator; int newDenominator = denominator * other.numerator; return RationalNumber(newNumerator, newDenominator); } // 约分 void simplify() { int gcd = getGCD(numerator, denominator); numerator /= gcd; denominator /= gcd; if (denominator < 0) { numerator *= -1; denominator *= -1; } } // 获取最大公约数 int getGCD(int a, int b) { if (b == 0) { return a; } return getGCD(b, a % b); } // 输出有理数 void print() const { if (denominator == 1) { cout << numerator << endl; } else { cout << numerator << "/" << denominator << endl; } } }; int main() { RationalNumber r1(2, 3); RationalNumber r2(3, 4); RationalNumber r3 = r1 + r2; RationalNumber r4 = r1 - r2; RationalNumber r5 = r1 * r2; RationalNumber r6 = r1 / r2; cout << "r1 = "; r1.print(); cout << "r2 = "; r2.print(); cout << "r1 + r2 = "; r3.print(); cout << "r1 - r2 = "; r4.print(); cout << "r1 * r2 = "; r5.print(); cout << "r1 / r2 = "; r6.print(); return 0; } ``` 在该代码,定义了一个 `RationalNumber` ,包含了分子和分母两个私有成员变量,以及一些公有成员函数,包括构造函数、赋值运算符重载、加法、减法、乘法、除法运算符重载、约分、获取最大公约数、输出有理数等。在 `main` 函数,创建了两个有理数对象 `r1` 和 `r2`,并对其进行了加、减、乘、除等运算,最后输出了结果。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

Gremmie2003

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值