-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFraction.java
More file actions
68 lines (58 loc) · 1.18 KB
/
Fraction.java
File metadata and controls
68 lines (58 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
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();
}
}
class Fraction {
int fenzi;
int fenmu;
Fraction() { // 无参构造
fenzi = 1;
fenmu = 1;
}
Fraction(int a, int b) {
fenzi = a;
fenmu = b;
}
double toDouble() {
return fenzi * 1.0 / fenmu;
}
Fraction plus(Fraction r) {
return new Fraction(this.fenmu * r.fenmu,this.fenzi * r.fenmu +
r.fenzi * this.fenmu);
}
Fraction multiply(Fraction r) {
return new Fraction(this.fenzi * r.fenzi,this.fenmu * r.fenmu);
}
/* 化简输出 */
void print() {
int temp;
int x = fenzi;
int y = fenmu;
// 求出最大公约数
while (x != 0) {
temp = y % x;
y = x;
x = temp;
}
fenzi /= y;
fenmu /= y;
if (fenzi == 0) {
System.out.println("0");
} else if (fenzi == fenmu) {
System.out.println("1");
} else {
System.out.println(fenzi + "/" + fenmu);
}
}
}