-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRomanNumerals.java
More file actions
146 lines (128 loc) · 3.4 KB
/
RomanNumerals.java
File metadata and controls
146 lines (128 loc) · 3.4 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
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
/*
By: Ben Hamula, 06/17/18
ROMAN NUMERALS: Takes in an integer, up to 4999, and outputs it as a Roman Numeral
Alternatively, can take in a Roman Numeral and return its integer equivalent
*/
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class RomanNumerals {
private StringBuilder sb = new StringBuilder();
/*
Letters for Roman numerals, representing 1, 5, 10, 50, 100, 500,
and 1000 respectively
*/
private ArrayList<String> getLetters() {
ArrayList<String> letters = new ArrayList<>();
letters.add("I"); letters.add("V"); letters.add("X"); letters.add("L");
letters.add("C"); letters.add("D"); letters.add("M");
return letters;
}
private void intToRoman(int intInput) {
mCheck(intInput);
System.out.println();
}
private void mCheck(int m) {
while (m > 999) {
sb.append("M");
m -= 1000;
}
mCheck2(m);
}
private void mCheck2(int m2) {
if (m2 > 899) {
sb.append("CM");
m2 -= 900;
}
dCheck(m2);
}
private void dCheck(int d) {
if (d > 399 && d < 500) {
sb.append("CD");
d -= 400;
}
if (d > 499) {
sb.append("D");
d -= 500;
}
cCheck(d);
}
private void cCheck(int c) {
while (c > 99) {
sb.append("C");
c -= 100;
}
if (c > 89) {
sb.append("XC");
c -= 90;
}
lCheck(c);
}
private void lCheck(int l) {
if (l > 39 && l < 50) {
sb.append("XL");
l -= 40;
}
if (l > 49) {
sb.append("L");
l -= 50;
}
xCheck(l);
}
private void xCheck(int x) {
while (x > 9) {
sb.append("X");
x -= 10;
}
if (x == 9) {
sb.append("IX");
x -= 9;
}
vCheck(x);
}
private void vCheck(int v) {
if (v > 4) {
sb.append("V");
v -= 5;
}
if (v == 4) {
sb.append("IV");
v -= 4;
}
iCheck(v);
}
private void iCheck(int i) {
while (i > 0) {
sb.append("I");
i -= 1;
}
System.out.println(sb);
}
private void validCheck() {
boolean valid = true;
while (valid) {
Scanner s = new Scanner(System.in);
System.out.print("Enter a number in Roman numerals: ");
String roman = s.next();
ArrayList<String> nums = getLetters();
for (int i = 0; i < roman.length(); i++) {
if (!nums.contains(roman.substring(i, i + 1)))
valid = false;
}
if (!valid) {
valid = true;
System.out.println("Input of '" + roman + "' not valid. Try again.");
}
else {
valid = false;
}
}
// function call
}
public static void main(String[] args) {
RomanNumerals r = new RomanNumerals();
//r.validCheck();
int x = 122;
r.intToRoman(x);
}
}