-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathZahlen.java
243 lines (223 loc) · 5.63 KB
/
Zahlen.java
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
class Roman
{
public int intValue;
protected String stringValue;
Roman(String string)
{
this.stringValue = string;
romanToInt();
}
Roman(int number)
{
this.intValue = number;
intToRoman();
}
public int getValue(char r)
{
if(r=='I')
{
return 1;
}
if(r=='V')
{
return 5;
}
if(r=='X')
{
return 10;
}
if(r=='L')
{
return 50;
}
if(r=='C')
{
return 100;
}
if(r=='D')
{
return 500;
}
if(r=='M')
{
return 1000;
}
return -1;
}
public void romanToInt()
{
String str = stringValue;
int sum = 0;
for(int i = 0; i< str.length(); i++)
{
int z1 = getValue(str.charAt(i));
if((i+1)<str.length())
{
int z2 = getValue(str.charAt(i+1));
//sowas wie XX oder VI, also keine Besonderheit
if(z1>=z2)
{
sum = sum + z1;
}
//z.B. IV; index wird erhöht, da IV ja ein Symbol ist und man sonst V doppelt hätte
else
{
sum = sum + (z2-z1);
i++;
}
}
else
{
sum = sum + z1;
}
}
intValue = sum;
}
public void intToRoman()
{
int number = intValue;
String str = "";
while(number >= 1000)
{
str = str + "M";
number = number - 1000;
}
while(number >= 900)
{
str = str + "CM";
number = number - 900;
}
while(number >= 500)
{
str = str + "D";
number = number - 500;
}
while(number >= 400)
{
str = str + "CD";
number = number - 400;
}
while(number >= 100)
{
str = str + "C";
number = number - 100;
}
while(number >= 90)
{
str = str + "XC";
number = number - 90;
}
while(number >= 50)
{
str = str + "L";
number = number - 50;
}
while(number >= 40)
{
str = str + "XL";
number = number - 40;
}
while(number >= 10)
{
str = str + "X";
number = number - 10;
}
while(number >= 9)
{
str = str + "IX";
number = number - 9;
}
while(number >= 5)
{
str = str + "V";
number = number - 5;
}
while(number >= 4)
{
str = str + "IV";
number = number - 4;
}
while(number >= 1)
{
str = str + "I";
number = number - 1;
}
stringValue = str;
}
public Roman add(Roman rom)
{
Roman result = new Roman(intValue);
result.intValue = rom.intValue + intValue;
result.intToRoman();
System.out.println(intValue + " (" + stringValue + ")" + " + " + rom.intValue + " (" + rom.stringValue + ")" + " = " + result.intValue + " (" + result.stringValue + ")");
return result;
}
public Roman substract(Roman rom)
{
Roman result = new Roman(intValue);
result.intValue = intValue - rom.intValue;
if(result.intValue < 0)
{
result.intValue = 0;
}
result.intToRoman();
System.out.println(intValue + " (" + stringValue + ")" + " - " + rom.intValue + " (" + rom.stringValue + ")" + " = " + result.intValue + " (" + result.stringValue + ")");
return result;
}
public Roman multiply(Roman rom)
{
Roman result = new Roman(intValue);
result.intValue = rom.intValue * intValue;
result.intToRoman();
System.out.println(intValue + " (" + stringValue + ")" + " * " + rom.intValue + " (" + rom.stringValue + ")" + " = " + result.intValue + " (" + result.stringValue + ")");
return result;
}
public Roman divide(Roman rom)
{
Roman result = new Roman(intValue);
result.intValue = intValue / rom.intValue;
result.intToRoman();
System.out.println(intValue + " (" + stringValue + ")" + " / " + rom.intValue + " (" + rom.stringValue + ")" + " = " + result.intValue + " (" + result.stringValue + ")");
return result;
}
@Override
public String toString()
{
return "Die römische Zahl " + stringValue + " entspricht " + intValue;
}
@Override
public int hashCode()
{
return intValue;
}
@Override
public boolean equals(Object obj)
{
if((obj != null) && (obj instanceof Roman))
{
if(hashCode() == ((Roman) obj).hashCode())
{
System.out.println("true");
return true;
}
}
System.out.println("false");
return false;
}
}
public class Zahlen
{
public static void main(String[] args)
{
Roman test1 = new Roman("MMXIV");
Roman test2 = new Roman(20);
Roman test3 = new Roman(1011);
Roman test4 = new Roman("MXI");
test1.add(test2);
test1.substract(test2);
test2.multiply(test2);
test1.divide(test3);
test3.equals(test4);
System.out.println(test1);
}
}