初学JAVA实现分数类Fraction及部分功能

设计一个表示分数的类Fraction。这个类用两个int类型的变量分别表示分子和分母。
源码如下

import java.util.Scanner;

class Fraction { //分数类
private int numerator; //分子
private int denominator; //分母

public Fraction(int n, int d) {		//构造分子分母,并约分
	// TODO Auto-generated constructor stub
	numerator = n;
	denominator = d;
	YueFen();
}
public void YueFen() { 				//同除最大公约数以约分
	int temp = FindMaxYueNum();
	numerator /= temp;
	denominator /= temp;
}

public int  FindMaxYueNum() {		//辗转相除法寻找最大公约数
	int big = 0, small = 0;
	if(numerator > denominator) {
		big = numerator;
		small = denominator;
	}else if(numerator < denominator) {
		big = denominator;
		small = numerator;
	}else {
		return numerator;
	}
	for(; big % small != 0; ) {
		int temp = big % small;
		big = small;
		small = temp;
	}
	return small;
}
	
public double toDouble() {					//转换为小数形式
	return (double)numerator / denominator;
}

public Fraction plus(Fraction r) {			//与分数r相加并约分
	Fraction a = new Fraction(1, 1);
	a.denominator = this.denominator * r.denominator;
	a.numerator = this.numerator*r.denominator + r.numerator*this.denominator;
	a.YueFen();
	return a;
}

public Fraction multiply(Fraction r) {		//与分数r相乘并约分
	Fraction a = new Fraction(1, 1);
	a.denominator = this.denominator * r.denominator;
	a.numerator = this.numerator * r.numerator;
	a.YueFen();
	return a;
}

public void print() {						//输出分数形式
	System.out.println(numerator+"/"+denominator);
}

public static void main(String[] args) {
	//Main
	Scanner in = new Scanner(System.in);
	Fraction a = new Fraction(in.nextInt(), in.nextInt());
	Fraction b = new Fraction(in.nextInt(),in.nextInt());
	
	a.print();
	b.print();
	
	a.plus(b).print();
	a.multiply(b).plus(new Fraction(5,6)).print();
	a.print();
	b.print();
	
	in.close();
}

}
输入样例:
2 4 1 3
输出:
1/2
1/3
5/6
1/1
1/2
1/3

下面是一个简单的 C++ 分数 `fraction` 的实现,它包含了分数的四则运算和比较运算。 ```cpp #include <iostream> using namespace std; class fraction { private: int num; // 分子 int den; // 分母 public: fraction(int n = 0, int d = 1) { if (d == 0) { cout << "分母不能为0!" << endl; exit(1); } if (d < 0) { n = -n; d = -d; } num = n; den = d; reduce(); } int getNum() const { return num; } int getDen() const { return den; } fraction operator-() const { return fraction(-num, den); } friend fraction operator+(const fraction& f1, const fraction& f2); friend fraction operator-(const fraction& f1, const fraction& f2); friend fraction operator*(const fraction& f1, const fraction& f2); friend fraction operator/(const fraction& f1, const fraction& f2); friend bool operator==(const fraction& f1, const fraction& f2); friend bool operator!=(const fraction& f1, const fraction& f2); friend bool operator<(const fraction& f1, const fraction& f2); friend bool operator>(const fraction& f1, const fraction& f2); friend bool operator<=(const fraction& f1, const fraction& f2); friend bool operator>=(const fraction& f1, const fraction& f2); friend istream& operator>>(istream& in, fraction& f); friend ostream& operator<<(ostream& out, const fraction& f); private: void reduce() { int gcd = getGCD(num, den); num /= gcd; den /= gcd; } int getGCD(int a, int b) { if (b == 0) return a; return getGCD(b, a % b); } }; fraction operator+(const fraction& f1, const fraction& f2) { return fraction(f1.getNum() * f2.getDen() + f2.getNum() * f1.getDen(), f1.getDen() * f2.getDen()); } fraction operator-(const fraction& f1, const fraction& f2) { return f1 + (-f2); } fraction operator*(const fraction& f1, const fraction& f2) { return fraction(f1.getNum() * f2.getNum(), f1.getDen() * f2.getDen()); } fraction operator/(const fraction& f1, const fraction& f2) { return fraction(f1.getNum() * f2.getDen(), f1.getDen() * f2.getNum()); } bool operator==(const fraction& f1, const fraction& f2) { return f1.getNum() == f2.getNum() && f1.getDen() == f2.getDen(); } bool operator!=(const fraction& f1, const fraction& f2) { return !(f1 == f2); } bool operator<(const fraction& f1, const fraction& f2) { return f1.getNum() * f2.getDen() < f2.getNum() * f1.getDen(); } bool operator>(const fraction& f1, const fraction& f2) { return f2 < f1; } bool operator<=(const fraction& f1, const fraction& f2) { return !(f2 < f1); } bool operator>=(const fraction& f1, const fraction& f2) { return !(f1 < f2); } istream& operator>>(istream& in, fraction& f) { char slash; in >> f.num >> slash >> f.den; f.reduce(); return in; } ostream& operator<<(ostream& out, const fraction& f) { out << f.getNum() << '/' << f.getDen(); return out; } int main() { fraction f1(1, 2), f2(3, 4), f3; cout << "f1 = " << f1 << endl; cout << "f2 = " << f2 << endl; cout << "f3 = " << f3 << endl; cout << "请输入一个分数:"; cin >> f3; cout << "f3 = " << f3 << endl; cout << "f1 + f2 = " << f1 + f2 << endl; cout << "f1 - f2 = " << f1 - f2 << endl; cout << "f1 * f2 = " << f1 * f2 << endl; cout << "f1 / f2 = " << f1 / f2 << endl; cout << "f1 == f2 ? " << (f1 == f2) << endl; cout << "f1 != f2 ? " << (f1 != f2) << endl; cout << "f1 < f2 ? " << (f1 < f2) << endl; cout << "f1 > f2 ? " << (f1 > f2) << endl; cout << "f1 <= f2 ? " << (f1 <= f2) << endl; cout << "f1 >= f2 ? " << (f1 >= f2) << endl; return 0; } ``` 上述实现中,分数 `fraction` 的成员变量包括分子 `num` 和分母 `den`,它们在构造函数中被初始化。构造函数中还进行了分母为零的判断和分数的约分处理。`fraction` 重载了一些运算符,包括一元负号运算符、二元加减乘除运算符和比较运算符。此外,还重载了输入输出流运算符,方便用户输入和输出分数。在主函数中,演示了如何使用这些运算符进行分数的运算和比较。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值