Java设计一个分数类。要求:1.分类包含的分数运算有:连个分数的加、减、乘、除运算。

设计一个分数类。要求:
1.分数中包含的分数运算有:两个分数的加、减、乘、除运算。
2.分数的输出格式是:“分子/分母”。
3.编写一个测试程序进行测试。
C++版本请复制链接查看http://blog.csdn.net/bee0_0/article/details/78106442package Cal;
package Cal;

import java.util.Scanner;

public class Fraction {
    private int numerator1;
    private int denominator1;
    private int numerator2;
    private int denominator2;
    private int numerator3;
    private int denominator3;

    void set(int numerator1, int denominator1, int numerator2, int denominator2) {
        this.denominator1 = denominator1;
        this.denominator2 = denominator2;
        this.numerator1 = numerator1;
        this.numerator2 = numerator2;
    }

    void multiply() {
        //乘法运算
        numerator3 = numerator1 * numerator2;
        //结果分子 = 分子1 * 分子2
        denominator3 = denominator1 * denominator2;
        //结果分母 = 分母1 * 分母2
        output(numerator1, denominator1, numerator2,
                denominator2, numerator3, denominator3, '*');
    }

    void divided() {
        //除法运算
        numerator3 = numerator1 * denominator2;
        denominator3 = denominator1 * numerator2;
        output(numerator1, denominator1, numerator2,
                denominator2, numerator3, denominator3, '/');
    }

    void plus() {
        int a, b, c;
        a = denominator1;
        b = denominator2;
        //使用相减法求最大公约数
        if (a == b) {
            denominator3 = a;
            numerator3 = numerator1 + numerator2;
        } else {
            while (a != b) {
                if (a > b) a = a - b;
                else b = b - a;
            }
            int t;//最小公倍数 = t
            t = (denominator1 * denominator2) / a;
            //最小公倍数 =( 分母1 * 分母2 )/最大公约数
            denominator3 = t;//结果的分母 = 最小公倍数
            numerator3 = ((t / denominator1)*denominator1) + ((t / denominator2)*denominator2);
            //结果的分子 = (最小公倍数/分母1*分母2+ (最小公倍数/分母2*分子2
        }
        output(numerator1, denominator1, numerator2,
                denominator2, numerator3, denominator3, '+');
    }

    void minus() {
        int a, b, c;
        //使用相减法求最大公约数
        double p, q;
        a = denominator1;
        b = denominator2;
        if (a == b) {
            a = denominator3;
            //当分母相同时分子相见应 大 - 小
            if (numerator1 > numerator2) {
                numerator3 = numerator1 - numerator2;
            } else {
                numerator3 = numerator2 - numerator1;
            }
        } else {
            while (a != b) {
                if (a > b) a = a - b;
                else b = b - a;
            }
            int t;//令最小公倍数 = t
            t = (denominator1 * denominator2) / a;
            //最小公倍数 =( 分母1 * 分母2 )/最大公约数
            denominator3 = t;
            //结果的分母 = 最小公倍数
            p = (double) numerator1 / (double) denominator1;
            q = (double) numerator2 / (double) denominator2;
            if ( p > q) {
                numerator3 = ((t / denominator1)*numerator1)- ((t / denominator2)*numerator2);
                output(numerator1, denominator1, numerator2,
                        denominator2, numerator3, denominator3, '-');
            } else {
                numerator3 = ((t / denominator2)*numerator2)- ((t / denominator1)*numerator1);
                output(numerator1, denominator1, numerator2,
                        denominator2, numerator3, -denominator3, '-');
            }
        }
    }

    public static void main(String[] arges) {
        Fraction a = new Fraction();//创建名为a的对象
        Scanner in = new Scanner(System.in);
        int x, y;//x = numerator1; y = denominator1;
        int m, n;//m = numerator2; n = denominator2;
        System.out.println("请输入第一个数的分子和分母 :");
        x = in.nextInt();
        y = in.nextInt();
        System.out.println("请输入第二个数的分子和分母 :");
        m = in.nextInt();
        n = in.nextInt();
        a.set(x, y, m, n);
        //将x,y,m,n通过set函数分别赋给 :
        //numerator1 denominator1 numerator2 denominator2
        a.multiply();
        a.divided();
        a.plus();
        a.minus();
    }

    void output(int a, int b, int c, int d, int e, int f, char name) {
        System.out.println(a + "/" + b + " " + name + " " + c + "/" + d + "=" + e + "/" + f);
        //    a   /   b     "+ - * /"    c   /   d    =    e   /   f
    }
};
  • 9
    点赞
  • 40
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值